Colton Magnant
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
Colton Magnant has a total of 74 co-authors. Here are the top co-authors by number of shared publications:
Pouria Salehi Nowbandegani
Vanderbilt University
9 shared publications- Yaping Mao
Academy of Plateau Science and Sustainability, and School of Mathematics and Statistics, Qinghai Normal University, Xining, China
9 shared publications - Xueliang Li
Center for Combinatorics and LPMC, Nankai University, Tianjin, China
8 shared publications - Zhao Wang
College of Science China Jiliang University 310018 Hangzhou China
7 shared publications - Ingo Schiermeyer
Institut für Diskrete Mathematik und Algebra, Technische Universität Bergakademie Freiberg, Freiberg, Germany
6 shared publications - Kenta Ozeki
Faculty of Environment and Information Sciences Yokohama National University Yokohama Japan
6 shared publications
Latest Publications
- 30 January 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (5)
Gallai-Ramsey numbers for fans
- 30 January 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (5)
Gallai-Ramsey numbers for fans
- 15 August 2022
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 38 (8) , 1317-1332
Gallai—Ramsey Number for the Union of Stars
- 15 August 2022
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 38 (8) , 1317-1332
Gallai—Ramsey Number for the Union of Stars
- 15 April 2022
- Published by Wiley in Journal of Graph Theory
- Vol. 101 (3) , 455-492
Gallai–Ramsey number for K5 ${K}_{5}$Given a graph , the ‐colored Gallai–Ramsey number is defined to be the minimum integer such that every ‐coloring of the edges of the complete graph on vertices contains either a rainbow triangle or a monochromatic copy of Fox et al. conjectured the values of the Gallai–Ramsey numbers for complete graphs. Recently, this conjecture has been verified for the first open case, when . In this paper we attack the next case, when . Surprisingly it turns out, that the validity of the conjecture depends upon the (yet unknown) value of the Ramsey number . It is known that and conjectured that . If , then Fox et al.'s conjecture is true and we present a complete proof. If, however, , then Fox et al.'s conjecture is false, meaning that exactly one of these conjectures is true while the other is false. For the case when , we show lower and upper bounds for the Gallai–Ramsey number .
- 15 April 2022
- Published by Wiley in Journal of Graph Theory
- Vol. 101 (3) , 455-492
Gallai–Ramsey number for K5 ${K}_{5}$Given a graph , the ‐colored Gallai–Ramsey number is defined to be the minimum integer such that every ‐coloring of the edges of the complete graph on vertices contains either a rainbow triangle or a monochromatic copy of Fox et al. conjectured the values of the Gallai–Ramsey numbers for complete graphs. Recently, this conjecture has been verified for the first open case, when . In this paper we attack the next case, when . Surprisingly it turns out, that the validity of the conjecture depends upon the (yet unknown) value of the Ramsey number . It is known that and conjectured that . If , then Fox et al.'s conjecture is true and we present a complete proof. If, however, , then Fox et al.'s conjecture is false, meaning that exactly one of these conjectures is true while the other is false. For the case when , we show lower and upper bounds for the Gallai–Ramsey number .
- 18 March 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (3) , 1425
Correction to: Generalized Rainbow Connection of Graphs
- 18 March 2022
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 45 (3) , 1425
Correction to: Generalized Rainbow Connection of Graphs
- 1 February 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (2) , 1-17
Ramsey and Gallai-Ramsey Number for Wheels
- 1 February 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (2) , 1-17
Ramsey and Gallai-Ramsey Number for Wheels
- Open Access
Gallai-Ramsey numbers of odd cycles
Given two graphs $G$ and $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number, denoted by $gr_{k}(G : H)$, is the minimum integer $N$ such that for all $n \geq N$, every $k$-coloring of the edges of $K_{n}$ contains either a rainbow copy of $G$ or a monochromatic copy of $H$. We prove that $gr_{k} (K_{3} : C_{2\ell + 1}) = \ell \cdot 2^{k} + 1$ for all $k \geq 1$ and $\ell \geq 3$.Open AccessGallai-Ramsey numbers of odd cycles
Given two graphs $G$ and $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number, denoted by $gr_{k}(G : H)$, is the minimum integer $N$ such that for all $n \geq N$, every $k$-coloring of the edges of $K_{n}$ contains either a rainbow copy of $G$ or a monochromatic copy of $H$. We prove that $gr_{k} (K_{3} : C_{2\ell + 1}) = \ell \cdot 2^{k} + 1$ for all $k \geq 1$ and $\ell \geq 3$. - 17 June 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (6) , 3991-4002
Generalized Rainbow Connection of Graphs
- 17 June 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (6) , 3991-4002
Generalized Rainbow Connection of Graphs
- 1 December 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (12)
Properly colored ’s in edge-colored graphs- 1 December 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (12)
Properly colored ’s in edge-colored graphs- 6 November 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (1) , 337-354
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs
- 6 November 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (1) , 337-354
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs
- 5 July 2020
- Published by Springer Nature
- p. 9-23
General Structure Under Forbidden Rainbow Subgraphs