On triangle-free random graphs

DOI<260::AID-RSA3>3.0.CO;2-Q 10.1002/(SICI)1098-2418(200005)16:3<260::AID-RSA3>3.0.CO;2-QzbMath0947.05071OpenAlexW2153478982MaRDI QIDQ4487094

Tomasz Łuczak

Publication date: 5 November 2000

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200005)16:3<260::aid-rsa3>3.0.co;2-q

zbMATH Keywords

random graphstriangle-free

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ A new proof of the KŁR conjecture ⋮ Lower tails via relative entropy ⋮ Topological minors in bipartite graphs ⋮ A short nonalgorithmic proof of the containers theorem for hypergraphs ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Szemerédi's Regularity Lemma for Matrices and Sparse Graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ Independent sets in hypergraphs

Cites Work

• Szemerédi’s Regularity Lemma for Sparse Graphs
• Unnamed Item