1 citations · 1 across the 4 of their papers we have counts for
4 papers
Bounds for B-coloring planar and outerplanar graphs
Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy
A proper coloring of the edges of a graph is one in which every is totally multicolored. A B-coloring is a coloring of the edges of in which every and every…
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…
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…
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…