DeepAI AI Chat
Log In Sign Up

Bounds on Ramsey Games via Alterations

09/06/2019
by   He Guo, et al.
Georgia Institute of Technology
0

This note contains a refined alteration approach for constructing H-free graphs: we show that removing all edges in H-copies of the binomial random graph does not significantly change the independence number (for suitable edge-probabilities); previous alteration approaches of Erdos and Krivelevich remove only a subset of these edges. We present two applications to online graph Ramsey games of recent interest, deriving new bounds for Ramsey, Paper, Scissors games and online Ramsey numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/19/2018

Improved Bounds for Guarding Plane Graphs with Edges

An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...
09/11/2020

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree

A 2-edge-colored graph or a signed graph is a simple graph with two type...
08/20/2019

An algorithm for destroying claws and diamonds

In the Claw,Diamond-Free Edge Deletion problem the input is a graph G an...
04/29/2020

Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models

Within the context of stochastic probing with commitment, we consider th...
08/11/2021

Linear Bounds for Cycle-free Saturation Games

Given a family of graphs ℱ, we define the ℱ-saturation game as follows. ...
10/20/2019

A New Connection Between Node and Edge Depth Robust Graphs

We create a graph reduction that transforms an (e, d)-edge-depth-robust ...
05/27/2019

Colonel Blotto Games and Hide-and-Seek Games as Path Planning Problems with Side Observations

Resource allocation games such as the famous Colonel Blotto (CB) and Hid...