Random Ramsey graphs for the four-cycle

DOI10.1016/0012-365X(94)90287-9zbMath0792.05128OpenAlexW1992935756WikidataQ97694770 ScholiaQ97694770MaRDI QIDQ1318835

Zoltan Fueredi

Publication date: 4 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90287-9

zbMATH Keywords

chromatic numberfour-cyclerandom Ramsey graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Related Items (19)

Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ A new proof of the KŁR conjecture ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ Turán's extremal problem in random graphs: Forbidding odd cycles ⋮ Turán's theorem for pseudo-random graphs ⋮ On \(K^ 4\)-free subgraphs of random graphs ⋮ Counting hypergraphs with large girth ⋮ Random polynomial graphs for random Turán problems ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ The fine structure of octahedron-free graphs ⋮ The number of \(K_{m,m}\)-free graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers ⋮ Regular pairs in sparse random graphs I ⋮ Independent sets in hypergraphs ⋮ A hierarchy of randomness for graphs

Cites Work

• Unnamed Item
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• On the number of graphs without 4-cycles
• On Ramsey graphs without bipartite subgraphs
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Strong Ramsey Theorems for Steiner Systems

This page was built for publication: Random Ramsey graphs for the four-cycle