The triangle-free process
From MaRDI portal
Publication:1023043
DOI10.1016/j.aim.2009.02.018zbMath1195.05074arXiv0806.4375WikidataQ30048205 ScholiaQ30048205MaRDI QIDQ1023043
Publication date: 10 June 2009
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.4375
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
60G99: Stochastic processes
05C55: Generalized Ramsey theory
Related Items
Triangle‐free subgraphs in the triangle‐free 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, 4-cycles at the triangle-free process, The Bohman-Frieze process near criticality, A note on regular Ramsey graphs, Ramsey games with giants, The Final Size of theC4-Free Process, Hypergraph Ramsey numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Birth control for giants
- A note on Ramsey numbers
- A note on the independence number of triangle-free graphs. II
- Asymptotic lower bounds for Ramsey functions
- Explicit Ramsey graphs and orthonormal labelings
- Constrainted graph processes
- A note on regular Ramsey graphs
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence
- Graph Theory and Probability. II
- Random Graph Processes with Degree Restrictions
- On the size of a random maximal graph
- Bounding Ramsey numbers through large deviation inequalities
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Product rule wins a competitive game
- Creating a Giant Component
- Probability Inequalities for Sums of Bounded Random Variables
- Some graph theoretic results associated with Ramsey's theorem