Bounds on Ramsey Games via Alterations
arXiv:1909.02691 · doi:10.1002/jgt.22973
Abstract
We present a refinement of the classical alteration method for constructing -free graphs: for suitable edge-probabilities , we show that removing all edges in -copies of the binomial random graph does not significantly change the independence number. This differs from earlier alteration approaches of Erdős and Krivelevich, who obtained similar guarantees by removing one edge from each -copy (instead of all of them). We demonstrate the usefulness of our refined alternation method via two applications to online graph Ramsey games, where it enables easier analysis.
arXiv comment10 pages; minor edits; to appear in the Journal of Graph Theory
References in corpus (7)
- The early evolution of the H-free process
- Upper tails for arithmetic progressions in random subsets
- Packing nearly optimal Ramsey R(3,t) graphs
- A counterexample to the DeMarco-Kahn Upper Tail Conjecture
- On the missing log in upper tail estimates
- Upper tail bounds for Stars
- On the power of random greedy algorithms