An improvement to Mathon's cyclotomic Ramsey colorings

zbMATH Open1159.05039MaRDI QIDQ1010891FDOQ1010891

Authors: Xiaodong Xu, Stanisław P. Radziszowski 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129768

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• An improved lower bound on multicolor Ramsey numbers
• On the multi-colored Ramsey numbers of cycles
• An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
• scientific article; zbMATH DE number 2076935
• An improved method for recursively computing upper bounds for two-colour Ramsey numbers
• Ramsey-type results for Gallai colorings
• An improvement to ``A note on Euclidean Ramsey theory
• The multicolor size-Ramsey numbers of cycles
• On the multi-colored Ramsey numbers of paths and even cycles

zbMATH Keywords

edge coloringmulticolor Ramsey numberMathon's cyclotomic coloringsmonochromatic complete subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cited In (2)

• Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization
• Towards a version of Ohba's conjecture for improper colorings

This page was built for publication: An improvement to Mathon's cyclotomic Ramsey colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010891)