Ramsey properties of random hypergraphs

DOI10.1006/jcta.1997.2785zbMath0893.05011OpenAlexW1974683938MaRDI QIDQ1380335

Vojtěch Rödl, Andrzej Ruciński

Publication date: 2 August 1998

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

Full work available at URL: https://semanticscholar.org/paper/49aa0fbea095383e9b92a8ae9528ef155098a9f2

zbMATH Keywords

Ramsey theoryrandom \(k\)-uniform hypergraph

Mathematics Subject Classification ID

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

Related Items

On characterizing hypergraph regularity, Combinatorial theorems in sparse random sets, On the stability of the Erdős-Ko-Rado theorem, SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Note on the 3-graph counting Lemma, An algorithmic framework for obtaining lower bounds for random Ramsey problems, An exponential-type upper bound for Folkman numbers, Sharp thresholds for certain Ramsey properties of random graphs, Counting subgraphs in quasi‐random 4‐uniform hypergraphs, Regular pairs in sparse random graphs I, Ramsey properties of random discrete structures, An asymmetric random Rado theorem: 1-statement, A hierarchy of randomness for graphs, Upper bounds on probability thresholds for asymmetric Ramsey properties, A randomized version of Ramsey's theorem

Cites Work

• Ramsey properties of random graphs
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• Poisson approximation for large deviations
• Random graphs with monochromatic triangles in every edge coloring
• A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
• Threshold Functions for Ramsey Properties
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item