On the size of a random maximal graph

DOI10.1002/RSA.3240060217MaRDI QIDQ4697820zbMATH OpenOpenAlexWikidataFDO

Authors Stephen Suen, Peter Winkler, P. 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

zbMATH Keywords

Ramsey number \(R(3,k)\)random graphtriangle avoidance process

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• The triangle-free process and the Ramsey number \(R(3,k)\)
• The triangle-free process
• Dynamic concentration of the triangle‐free process
• Dynamic concentration of the triangle-free process

Cites work

• Random Graph Processes with Degree Restrictions

Cited in

(45)

• The triangle-free process
• The size of the largest hole in a random graph
• An extremal problem for random graphs and the number of graphs with large even-girth
• Packing nearly optimal Ramsey R(3,t) graphs
• The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
• The \(Q_2\)-free process in the hypercube
• Random triangle removal
• The maximum degree of a random graph
• 4-cycles at the triangle-free process
• The diamond-free process
• A note on regular Ramsey graphs
• The final size of the \(C_{4}\)-free process
• On the random greedy \(F\)-free hypergraph process
• scientific article; zbMATH DE number 4179410 (Why is no real title available?)
• On the random greedy F-free hypergraph process
• A random triadic process
• The Kőnig graph process
• Randomly generated intersecting hypergraphs II
• A random triadic process
• On the random satisfiable process
• Dense subgraphs in the H-free process
• Ramsey numbers of \(K_3\) and \(K_{n,n}\)
• The Maximum Block Size of Critical Random Graphs
• Random maximalH-free graphs
• Generating random networks without short cycles
• Large triangle packings and Tuza's conjecture in sparse random graphs
• The triangle-free process and the Ramsey number \(R(3,k)\)
• Closing the random graph gap in Tuza's conjecture through the online triangle packing process
• Expected Maximum Block Size in Critical Random Graphs
• The Game Saturation Number of a Graph
• On the method of typical bounded differences
• When does the \(K_{4}\)-free process stop?
• The random planar graph process
• The C_ℓ‐free process
• scientific article; zbMATH DE number 7651162 (Why is no real title available?)
• 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
• Greedy maximal independent sets via local limits
• \(d\)-connectivity of the random graph with restricted budget
• Minimizing the number of complete bipartite graphs in a K_s-saturated graph
• The linear q-hypergraph process
• Sharper analysis of the random graph d-process via a balls-in-bins model
• The early evolution of the \(H\)-free process

This page was built for publication: On the size of a random maximal graph

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