K5‐free subgraphs of random graphs

DOI10.1002/rsa.20000zbMath1035.05084DBLPjournals/rsa/GerkeSS04OpenAlexW2035530079WikidataQ97694980 ScholiaQ97694980MaRDI QIDQ4459590

Angelika Steger, Stefanie Gerke, Thomas Schickinger

Publication date: 29 March 2004

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

Full work available at URL: https://doi.org/10.1002/rsa.20000

zbMATH Keywords

coversbipartite graphsmulticovers

Mathematics Subject Classification ID

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

Related Items (8)

Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ A new proof of the KŁR conjecture ⋮ Extremal results for random discrete structures ⋮ Combinatorial theorems in sparse random sets ⋮ On the KŁR conjecture in random graphs ⋮ \(K_4\)-free subgraphs of random graphs revisited ⋮ Turánnical hypergraphs ⋮ Independent sets in hypergraphs

Cites Work

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

This page was built for publication: K₅‐free subgraphs of random graphs