Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
From MaRDI portal
Publication:2335906
DOI10.4310/JOC.2020.V11.N1.A2zbMath1427.05087arXiv1804.04195WikidataQ127198828 ScholiaQ127198828MaRDI QIDQ2335906
Louis DeBiasio, Gábor N. Sárközy, Robert A. Krueger, Miklós Ruszinkó, András Gyárfás
Publication date: 18 November 2019
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.04195
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (4)
The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ Bipartite Ramsey numbers of cycles ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Multicolour bipartite Ramsey number of paths
This page was built for publication: Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs