Random maximalH-free graphs

DOI10.1002/1098-2418(200101)18:1%3C61::AID-RSA5%3E3.0.CO;2-TMaRDI QIDQ4761358zbMATH OpenOpenAlexFDO

Authors Deryk Osthus, Anusch Taraz

Publication date 30 August 2001

Full work available at URL https://doi.org/10.1002/1098-2418(200101)18:1%3C61::aid-rsa5%3E3.0.co;2-t

zbMATH Keywords

boundschromatic numbergirthrandom greedy processrandom maximal \(H\)-free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Lower bounds for the size of random maximal H-free graphs
• The early evolution of the \(H\)-free process
• Dense subgraphs in the H-free process
• On the random greedy F-free hypergraph process
• The reverse \(H\)-free process for strictly 2-balanced graphs

Cites work

• On the size of a random maximal graph

Cited in

(30)

• Lower bounds for the size of random maximal H-free graphs
• The triangle-free process
• Many cliques in \(H\)-free subgraphs of random graphs
• Packing nearly optimal Ramsey R(3,t) graphs
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Almost all graphs with high girth and suitable density have high chromatic number
• 4-cycles at the triangle-free process
• The diamond-free process
• The final size of the \(C_{4}\)-free process
• On the random greedy \(F\)-free hypergraph process
• On the random greedy F-free hypergraph process
• Dense subgraphs in the H-free process
• Ramsey numbers of \(K_3\) and \(K_{n,n}\)
• scientific article; zbMATH DE number 1948235 (Why is no real title available?)
• scientific article; zbMATH DE number 867706 (Why is no real title available?)
• Generating random networks without short cycles
• The triangle-free process and the Ramsey number \(R(3,k)\)
• The reverse \(H\)-free process for strictly 2-balanced graphs
• On the method of typical bounded differences
• When does the \(K_{4}\)-free process stop?
• The C_ℓ‐free process
• The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes
• Dynamic concentration of the triangle‐free process
• A randomized construction of high girth regular graphs
• A variant of the Erdős–Rényi random graph process
• Prominent examples of flip processes
• \(d\)-connectivity of the random graph with restricted budget
• Minimizing the number of complete bipartite graphs in a K_s-saturated graph
• On a Ramsey-Turán variant of Roth's theorem
• The early evolution of the \(H\)-free process

This page was built for publication: Random maximalH-free graphs

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