12 citations · 25 across the 12 of their papers we have counts for
23 papers
Monotone Property Thresholds
Colton Magnant, Thor Whalen
This paper was originally written by the authors circa 2005 but was never submitted for publication. The present version corrects minor errors, adds references to work published si…
Gallai-Ramsey number for the union of stars
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of the complete graph…
Gallai Ramsey number for double stars
Gyula O. H. Katona, Colton Magnant, Yaping Mao +1
Given a graph and a positive integer , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices such that any -edge coloring of contains…
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
Properly colored 's in edge-colored graphs
Chuandong Xu, Colton Magnant, Shenggui Zhang
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain…
Ramsey and Gallai-Ramsey number for wheels
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…