Extremal Results in Random Graphs

DOI10.1007/978-3-642-39286-3_20zbMath1304.05125arXiv1302.2248OpenAlexW1496389011WikidataQ105584585 ScholiaQ105584585MaRDI QIDQ5416091

Vojtěch Rödl, Mathias Schacht

Publication date: 19 May 2014

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

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

zbMATH Keywords

cliquesrandom graphcoloringextremal graphTurán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (11)

On random subgraphs of Kneser and Schrijver graphs ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM ⋮ On an anti-Ramsey threshold for random graphs ⋮ A short nonalgorithmic proof of the containers theorem for hypergraphs ⋮ On the cycle space of a random graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ On “stability” in the Erdös--Ko--Rado Theorem ⋮ On Erdős–Ko–Rado for Random Hypergraphs II ⋮ On Erdős–Ko–Rado for random hypergraphs I

This page was built for publication: Extremal Results in Random Graphs