4-cycles at the triangle-free process

DOI10.1016/j.endm.2009.07.098zbMath1273.05208OpenAlexW2073814344MaRDI QIDQ2851522

Guy Wolfovitz

Publication date: 10 October 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.098

zbMATH Keywords

random graphstriangle-free process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Dense subgraphs in the \(H\)-free process ⋮ When does the K₄‐free process stop?

Cites Work

• Lower bounds for the size of random maximal \(H\)-free graphs
• The triangle-free process
• On the size of a random maximal graph
• Random maximalH-free graphs

This page was built for publication: 4-cycles at the triangle-free process