Conference item icon

Conference item

Online Ramsey numbers and the Subgraph Query Problem

Abstract:

The (m, n)-online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each turn and Painter immediately paints it red or blue. Builder’s goal is to force Painter to create either a red Km or a blue Kn using as few turns as possible. The online Ramsey number ~r(m; n) is the minimum number of edges Builder needs to guarantee a win in the (m; n)-online Ramsey game. By analyzing the special case...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Mathematical Institute
Oxford college:
Wadham College
Role:
Author
ORCID:
0000-0001-5899-1829
More from this funder
Funding agency for:
Conlon, D
More from this funder
Funding agency for:
Conlon, D
Publisher:
Springer Publisher's website
Volume:
28
Series:
Bolyai Society Mathematical Studies
Publication date:
2019-01-01
Acceptance date:
2018-10-22
ISSN:
1217-4696
Pubs id:
pubs:948538
URN:
uri:4acf63d2-4890-4f97-80f0-370362e91f02
UUID:
uuid:4acf63d2-4890-4f97-80f0-370362e91f02
Local pid:
pubs:948538
ISBN:
9783662592038

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP