Ingo Schiermeyer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Ingo Schiermeyer has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Yaping Mao
Academy of Plateau Science and Sustainability, and School of Mathematics and Statistics, Qinghai Normal University, Xining, China
11 shared publications - Stanislav Jendrol'
Institute of Mathematics, P. J. Šafárik University, Košice, Slovakia
8 shared publications - Trung Duy Doan
Hanoi Univ Sci & Technol, Fac Math & Informat, Hanoi, Vietnam
8 shared publications - Colton Magnant
Department of Mathematics, Clayton State University, Morrow, USA
6 shared publications - Christoph Brause
TU Bergakademie Freiberg
5 shared publications - Zhao Wang
College of Science China Jiliang University 310018 Hangzhou China
5 shared publications
Latest Publications
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (1) , 279
Bounds for irredundant and CO-irredundant Ramsey numbers
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (1) , 279
Bounds for irredundant and CO-irredundant Ramsey numbers
- 6 November 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- p. 1-15
Ramsey Numbers for Linear Forest-Kipas and Its Applications in Gallai-Ramsey Numbers
- 6 November 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- p. 1-15
Ramsey Numbers for Linear Forest-Kipas and Its Applications in Gallai-Ramsey Numbers
- 1 March 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 41 (2) , 425-440
Ramsey and Gallai-Ramsey Numbers of Cycles and Books
- 1 March 2025
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 41 (2) , 425-440
Ramsey and Gallai-Ramsey Numbers of Cycles and Books
- Open Access
Open problems of the 32nd Workshop on Cycles and Colourings
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of the 32nd edition of the workshop which took place in Poprad, Slovakia during September 8-13, 2024 (see the workshop webpage https://candc.upjs.sk).
Open AccessOpen problems of the 32nd Workshop on Cycles and Colourings
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by participants of the 32nd edition of the workshop which took place in Poprad, Slovakia during September 8-13, 2024 (see the workshop webpage https://candc.upjs.sk).
- 26 October 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-13
Gallai–Ramsey Numbers for Paths
- 26 October 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (6) , 1-13
Gallai–Ramsey Numbers for Paths
- 5 August 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 34-44
The proper 2-connection number of several graph classes
- 5 August 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 34-44
The proper 2-connection number of several graph classes
- 5 August 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 482
The conflict-free connection number and the minimum degree-sum of graphs
- 5 August 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 482
The conflict-free connection number and the minimum degree-sum of graphs
- 19 June 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 479
Graphs with large (1,2)-rainbow connection numbers
- 19 June 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 479
Graphs with large (1,2)-rainbow connection numbers
- Open Access
Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
A set of vertices $X\subseteq V$ in a simple graph $G(V,E)$ is irredundant (CO-irredundant) if each vertex $x\in X$ is either isolated in the induced subgraph $G[X]$ or else has a private neighbor $y\in V\setminus X$ ($y\in V$) that is adjacent to $x$ and to no other vertex of $X$. The irredundant Ramsey number $s(t_{1},\ldots,t_{l})$, CO-irredundant Ramsey number $s_{\operatorname{CO}}(t_{1},\ldots,t_{l})$, is the minimum $N$ such that every $l$-coloring of the edges of the complete graph $K_{N}$ on $N$ vertices has a monochromatic irredundant set, a monochromatic CO-irredundant set, of size $t_{i}$ for some $1\leq i\leq l$, respectively. In this paper, firstly, we establish a lower bound for the irredundant Ramsey number $s(t_{1},\ldots,t_{l})$ by a random and probabilistic method. Secondly, we improve an upper bound for $s(3,9)$ such that $24\leq s(3,9)\leq 26$. Thirdly, using Krivelevich's lemma, we establish an asymptotic lower bound for the $\operatorname{CO}$-irredundant Ramsey number $s_{\operatorname{CO}}(m,n)$.Open AccessAsymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
A set of vertices $X\subseteq V$ in a simple graph $G(V,E)$ is irredundant (CO-irredundant) if each vertex $x\in X$ is either isolated in the induced subgraph $G[X]$ or else has a private neighbor $y\in V\setminus X$ ($y\in V$) that is adjacent to $x$ and to no other vertex of $X$. The irredundant Ramsey number $s(t_{1},\ldots,t_{l})$, CO-irredundant Ramsey number $s_{\operatorname{CO}}(t_{1},\ldots,t_{l})$, is the minimum $N$ such that every $l$-coloring of the edges of the complete graph $K_{N}$ on $N$ vertices has a monochromatic irredundant set, a monochromatic CO-irredundant set, of size $t_{i}$ for some $1\leq i\leq l$, respectively. In this paper, firstly, we establish a lower bound for the irredundant Ramsey number $s(t_{1},\ldots,t_{l})$ by a random and probabilistic method. Secondly, we improve an upper bound for $s(3,9)$ such that $24\leq s(3,9)\leq 26$. Thirdly, using Krivelevich's lemma, we establish an asymptotic lower bound for the $\operatorname{CO}$-irredundant Ramsey number $s_{\operatorname{CO}}(m,n)$. - Open Access
Ramsey and Gallai-Ramsey numbers for linear forests and kipas
For two graphs $G,H$, the \emph{Ramsey number} $r(G,H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_n$ contains either a red copy of $G$ or a blue copy of $H$. For two graphs $G,H$, the \emph{Gallai-Ramsey number} $\operatorname{gr}_k(G:H)$ is defined as the minimum integer $n$ such that any $k$-edge-coloring of $K_n$ must contain either a rainbow copy of $G$ or a monochromatic copy of $H$. In this paper, the classical Ramsey numbers of linear forest versus kipas are obtained. We obtain the exact values of $\operatorname{gr}_k(G:H)$, where $H$ is either a path or a kipas and $G\in\{K_{1,3},P_4^+,P_5\}$ and $P_4^+$ is the graph consisting of $P_4$ with one extra edge incident with inner vertex.Open AccessRamsey and Gallai-Ramsey numbers for linear forests and kipas
For two graphs $G,H$, the \emph{Ramsey number} $r(G,H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_n$ contains either a red copy of $G$ or a blue copy of $H$. For two graphs $G,H$, the \emph{Gallai-Ramsey number} $\operatorname{gr}_k(G:H)$ is defined as the minimum integer $n$ such that any $k$-edge-coloring of $K_n$ must contain either a rainbow copy of $G$ or a monochromatic copy of $H$. In this paper, the classical Ramsey numbers of linear forest versus kipas are obtained. We obtain the exact values of $\operatorname{gr}_k(G:H)$, where $H$ is either a path or a kipas and $G\in\{K_{1,3},P_4^+,P_5\}$ and $P_4^+$ is the graph consisting of $P_4$ with one extra edge incident with inner vertex.