On the size of a random maximal graph
From MaRDI portal
Publication:4697820
DOI10.1002/rsa.3240060217zbMath0820.05054WikidataQ106175748 ScholiaQ106175748MaRDI QIDQ4697820
Peter M. Winkler, Stephen Suen, Paul Erdős
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
Unnamed Item, The Game Saturation Number of a Graph, When does the K4‐free process stop?, The random planar graph process, The Cℓ‐free process, On the random greedy \(F\)-free hypergraph process, A random triadic process, Dense subgraphs in the \(H\)-free process, Ramsey numbers of \(K_3\) and \(K_{n,n}\), The early evolution of the \(H\)-free process, The triangle-free process, Random triangle removal, 4-cycles at the triangle-free process, The diamond-free process, A note on regular Ramsey graphs, The Final Size of theC4-Free Process, On the Random Greedy $F$-Free Hypergraph Process, Randomly generated intersecting hypergraphs II, A Random Triadic Process, On the Random Satisfiable Process
Cites Work