Ramsey theory for highly connected monochromatic subgraphs
Logic
2018-12-18 v1
Abstract
An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly connected subgraphs all of whose edges are colored by the same color.
Cite
@article{arxiv.1812.06386,
title = {Ramsey theory for highly connected monochromatic subgraphs},
author = {Jeffrey Bergfalk and Michael Hrušák and Saharon Shelah},
journal= {arXiv preprint arXiv:1812.06386},
year = {2018}
}
Comments
11 pages