4-cycles at the triangle-free process

DOI10.1016/J.ENDM.2009.07.098MaRDI QIDQ2851522zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The triangle-free process
• The final size of the \(C_{4}\)-free process
• Random triangle removal
• Dynamic concentration of the triangle‐free process
• Dynamic concentration of the triangle-free process

Cites work

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

Cited in

(4)

• The final size of the \(C_{4}\)-free process
• Dense subgraphs in the H-free process
• scientific article; zbMATH DE number 1062566 (Why is no real title available?)
• When does the \(K_{4}\)-free process stop?

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

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