1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 1 cited
Large Monochromatic Components of Small Diameter
Erik Carlson, Ryan R. Martin, Bo Peng +1
Gyárfás conjectured in 2011 that every -edge-colored contains a monochromatic component of bounded ("perhaps three") diameter on at least vertices. Letzter prove…
math.CO2018
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
Louis DeBiasio, András Gyárfás, Robert A. Krueger +2
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertices…
math.CO2011
Uniform hypergraphs containing no grids
Zoltán Füredi, Miklós Ruszinkó
A hypergraph is called an r by r grid if it is isomorphic to a pattern of r horizontal and r vertical lines. Three sets form a triangle if they pairwise intersect in three distinct…