On the size of a random maximal graph
From MaRDI portal
Publication:4697820
DOI10.1002/rsa.3240060217zbMath0820.05054OpenAlexW2134771417WikidataQ106175748 ScholiaQ106175748MaRDI QIDQ4697820
Stephen Suen, Peter M. Winkler
Publication date: 28 May 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060217
Related Items (34)
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 ⋮ A random triadic process ⋮ A Random Triadic 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,𝑘) ⋮ Unnamed Item ⋮ Ramsey numbers of \(K_3\) and \(K_{n,n}\) ⋮ On the Method of Typical Bounded Differences ⋮ The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\) ⋮ The \(Q_2\)-free process in the hypercube ⋮ On the Random Satisfiable Process ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ When does the K4‐free process stop? ⋮ Random maximalH-free graphs ⋮ The early evolution of the \(H\)-free process ⋮ A note on regular Ramsey graphs ⋮ The random planar graph process ⋮ Generating Random Networks Without Short Cycles ⋮ The Kőnig graph process ⋮ The triangle-free process ⋮ The Final Size of theC4-Free Process ⋮ Large triangle packings and Tuza’s conjecture in sparse random graphs ⋮ The Cℓ‐free process ⋮ Randomly generated intersecting hypergraphs II ⋮ 4-cycles at the triangle-free process ⋮ Random triangle removal ⋮ The Game Saturation Number of a Graph
Cites Work
This page was built for publication: On the size of a random maximal graph
