Lower bounds for the size of random maximal \(H\)-free graphs

zbMath1178.05088arXiv0805.1747MaRDI QIDQ1010905

Guy Wolfovitz

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.1747

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (9)

The diamond-free process ⋮ Dynamic concentration of the triangle‐free process ⋮ A note on projective norm graphs ⋮ When does the K₄‐free process stop? ⋮ The early evolution of the \(H\)-free process ⋮ The Kőnig graph process ⋮ The C_ℓ‐free process ⋮ 4-cycles at the triangle-free process ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs

This page was built for publication: Lower bounds for the size of random maximal \(H\)-free graphs