Holes in random graphs

DOI10.1016/0166-218X(91)90045-XzbMath0763.05090MaRDI QIDQ1174180

Tomasz Łuczak

Publication date: 25 June 1992

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

zbMATH Keywords

holescyclesrandom graph

Mathematics Subject Classification ID

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

Related Items (1)

Geodesic cycles in random graphs

Cites Work

• Unnamed Item
• The chromatic number of random graphs at the double-jump threshold
• The number of matchings in random regular graphs and bipartite graphs
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• The size of the largest hole in a random graph
• The chromatic number of random graphs

This page was built for publication: Holes in random graphs