Holes in random graphs

DOI10.1016/0166-218X(91)90045-XMaRDI QIDQ1174180zbMATH OpenFDO

Authors Tomasz Łuczak

Publication date 25 June 1992

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

zbMATH Keywords

random graphholescycles

Mathematics Subject Classification ID

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

Recommendations

• The size of the largest hole in a random graph
• Large holes in sparse random graphs
• The largest hole in sparse random graphs

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• The chromatic number of random graphs
• The chromatic number of random graphs at the double-jump threshold
• The number of matchings in random regular graphs and bipartite graphs
• The size of the largest hole in a random graph

Cited in

(8)

• Graphs with all holes the same length
• On Induced Paths, Holes, and Trees in Random Graphs
• Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
• On induced paths, holes and trees in random graphs
• Large holes in sparse random graphs
• The largest hole in sparse random graphs
• The size of the largest hole in a random graph
• Geodesic cycles in random graphs

This page was built for publication: Holes in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174180)