An explicit construction for a Ramsey problem
From MaRDI portal
Publication:705745
DOI10.1007/S00493-004-0019-6zbMATH Open1058.05025OpenAlexW2072455759MaRDI QIDQ705745FDOQ705745
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
Recommendations
Cited In (19)
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
- New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
- A construction for Ramsey numbers for \(K_{m,n}\)
- Ramsey classes: examples and constructions
- When is an Almost MonochromaticK4Guaranteed?
- A (5,5)-Colouring of Kn with Few Colours
- On colorful edge triples in edge-colored complete graphs
- Explicit Construction of RIP Matrices Is Ramsey‐Hard
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs
- 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
- Explicit constructions of triple systems for Ramsey–Turán problems
- Growth rates of the bipartite Erdős-Gyárfás function
- A generalized Ramsey problem
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Coloring triple systems with local conditions
- Ramsey-type problem for an almost monochromatic \(K_4\)
- New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
- A simple and non-trivial Ramsey test
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)
