The size of the largest hole in a random graph

DOI10.1016/0012-365X(93)90230-QzbMath0779.05050MaRDI QIDQ1210559

Tomasz Łuczak

Publication date: 30 August 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphinduced cyclelargest hole

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (8)

On Induced Paths, Holes, and Trees in Random Graphs ⋮ Short proofs for long induced paths ⋮ The largest hole in sparse random graphs ⋮ The Induced Size-Ramsey Number of Cycles ⋮ Geodesic cycles in random graphs ⋮ Holes in random graphs ⋮ Structure and colour in triangle-free graphs ⋮ Large Induced Matchings in Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic number of random graphs at the double-jump threshold
• Trees in random graphs
• The number of matchings in random regular graphs and bipartite graphs
• Induced trees in sparse random graphs
• Large holes in sparse random graphs
• Maximal induces trees in sparse random graphs
• Large induced trees in sparse random graphs
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: The size of the largest hole in a random graph