An explicit construction for a Ramsey problem

DOI10.1007/S00493-004-0019-6MaRDI QIDQ705745zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi

Publication date 14 February 2005

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-004-0019-6

zbMATH Keywords

algebraic methodcoloringexplicit constructionsRamsey problems

Mathematics Subject Classification ID

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

Recommendations

• Edge-coloring cliques with three colors on all 4-cliques
• On generalized Ramsey theory: The bipartite case
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• A generalized Ramsey problem
• scientific article; zbMATH DE number 3494450

Cited in

(24)

• Weighted arcs, the finite Radon transform and a Ramsey problem
• A generalized Ramsey problem
• A simple and non-trivial Ramsey test
• An explicit edge-coloring of K_n with six colors on every K₅
• On colorful edge triples in edge-colored complete graphs
• Coloring triple systems with local conditions
• Ramsey classes: examples and constructions
• When is an Almost MonochromaticK₄Guaranteed?
• Colorings generated by monotone properties
• A (5,5)-Colouring of K_n with Few Colours
• Color isomorphic even cycles and a related Ramsey problem
• Explicit Construction of RIP Matrices Is Ramsey‐Hard
• Ramsey-type problem for an almost monochromatic \(K_4\)
• Explicit constructions of triple systems for Ramsey–Turán problems
• New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
• Lower bounds on the Erdős–Gyárfás problem via color energy graphs
• New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
• The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
• Ramsey theory constructions from hypergraph matchings
• Growth rates of the bipartite Erdős-Gyárfás function
• Generalized Ramsey numbers of cycles, paths, and hypergraphs
• A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
• A construction for Ramsey numbers for \(K_{m,n}\)
• Edge-colorings avoiding rainbow and monochromatic subgraphs

This page was built for publication: An explicit construction for a Ramsey problem

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