An algorithmic framework for obtaining lower bounds for random Ramsey problems

DOI10.1016/j.jctb.2016.12.007zbMath1398.05214arXiv1408.5271OpenAlexW2964263579WikidataQ105583659 ScholiaQ105583659MaRDI QIDQ1989950

Angelika Steger, Rajko Nenadov, Nemanja Škorić, Yury Person

Publication date: 29 October 2018

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

Full work available at URL: https://arxiv.org/abs/1408.5271

zbMATH Keywords

random graphshypergraphsanti-RamseyRamsey-type problems0-statementrainbow and properly colored graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (10)

Anti-Ramsey threshold of cycles for sparse graphs ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS ⋮ The anti-Ramsey threshold of complete graphs ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Minimal ordered Ramsey graphs ⋮ Anti-Ramsey threshold of cycles ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial theorems in sparse random sets
• On an anti-Ramsey threshold for random graphs
• Ramsey properties of random graphs
• Anti-Ramsey properties of random graphs
• Threshold functions
• The Ramsey property for graphs with forbidden complete subgraphs
• The size Ramsey number
• Ramsey properties of random hypergraphs
• Multicolored subsets in colored hypergraphs
• A sharp threshold for van der Waerden's theorem in random subsets
• On the threshold for the Maker-BreakerH-game
• Ramsey properties of random discrete structures
• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
• Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
• Rainbow subgraphs in properly edge‐colored graphs
• Random graphs with monochromatic triangles in every edge coloring
• Sharp thresholds for certain Ramsey properties of random graphs
• On an anti‐Ramsey threshold for sparse graphs with one triangle
• Threshold Functions for Ramsey Properties
• A Short Proof of the Random Ramsey Theorem

This page was built for publication: An algorithmic framework for obtaining lower bounds for random Ramsey problems