Random maximalH-free graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T" /><61::AID-RSA5>3.0.CO;2-T 10.1002/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-TzbMath0967.05060OpenAlexW2118626701MaRDI QIDQ4761358

Deryk Osthus, Anusch Taraz

Publication date: 30 August 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200101)18:1<61::aid-rsa5>3.0.co;2-t

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (24)

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes ⋮ On the Random Greedy $F$-Free Hypergraph Process ⋮ On the random greedy \(F\)-free hypergraph process ⋮ The diamond-free process ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ 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 ⋮ Dense subgraphs in the \(H\)-free process ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Prominent examples of flip processes ⋮ Ramsey numbers of \(K_3\) and \(K_{n,n}\) ⋮ On the Method of Typical Bounded Differences ⋮ 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 ⋮ When does the K₄‐free process stop? ⋮ The early evolution of the \(H\)-free process ⋮ \(d\)-connectivity of the random graph with restricted budget ⋮ Generating Random Networks Without Short Cycles ⋮ The triangle-free process ⋮ The Final Size of theC₄-Free Process ⋮ The C_ℓ‐free process ⋮ 4-cycles at the triangle-free process ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs

Cites Work

• On the size of a random maximal graph

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