New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)

DOI10.1006/jctb.2000.1954zbMath1030.05078OpenAlexW1980923667MaRDI QIDQ1850475

Felix Lazebnik, Andrew J. Woldar

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1954

zbMATH Keywords

edge coloringedge decompositionpolarity graphmonochromatic graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (12)

Multicolored set multipartite Ramsey numbers ⋮ Ramsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\) ⋮ The independence number for polarity graphs of even order planes ⋮ Configurations in projective planes and quadrilateral-star Ramsey numbers ⋮ Bipartite Ramsey numbers of \(K_{t,s}\) in many colors ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ General properties of some families of graphs defined by systems of equations ⋮ New lower bounds for Ramsey numbers of graphs and hypergraphs ⋮ New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\) ⋮ Multi-color Ramsey numbers of even cycles ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs ⋮ Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations

Cites Work

• The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\)
• On multicolor Ramsey numbers for complete bipartite graphs
• Generalised Ramsey numbers for small graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)