Large holes in sparse random graphs

DOI10.1007/BF02579303zbMath0662.05052WikidataQ57401623 ScholiaQ57401623MaRDI QIDQ1113926

Alan M. Frieze, Bill Jackson

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

induced cyclesrandom graph evolution

Mathematics Subject Classification ID

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

Related Items

On Induced Paths, Holes, and Trees in Random Graphs ⋮ Short proofs for long induced paths ⋮ Depth first exploration of a configuration model ⋮ Maximal induces trees in sparse random graphs ⋮ The largest hole in sparse random graphs ⋮ On large induced trees and long induced paths in sparse random graphs ⋮ The size of the largest hole in a random graph ⋮ Large induced trees in sparse random graphs ⋮ Large Induced Matchings in Random Graphs

Cites Work

• Trees in random graphs
• Induced 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: Large holes in sparse random graphs