Extremal subgraphs of random graphs

DOI10.1002/rsa.20413zbMath1252.05197arXiv0908.3778OpenAlexW2047159980MaRDI QIDQ3165456

Angelika Steger, Graham R. Brightwell, Konstantinos D. Panagiotou

Publication date: 26 October 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Mantel's theorem for random graphs ⋮ On the stability of the Erdős-Ko-Rado theorem ⋮ Random sum-free subsets of abelian groups ⋮ The typical structure of sparse $K_{r+1}$-free graphs

Cites Work

• Unnamed Item
• On \(K^ 4\)-free subgraphs of random graphs
• For which densities are random triangle-free graphs almost surely bipartite?
• Szemerédi’s Regularity Lemma for Sparse Graphs
• On the Evolution of Triangle-Free Graphs
• Extremal subgraphs of random graphs
• The Turn Theorem for Random Graphs
• Arithmetic progressions of length three in subsets of a random set

This page was built for publication: Extremal subgraphs of random graphs