arXiv Analytics

Sign in

arXiv:1812.06386 [math.LO]AbstractReferencesReviewsResources

Ramsey theory for highly connected monochromatic subgraphs

Jeffrey Bergfalk, Michael Hrušák, Saharon Shelah

Published 2018-12-16Version 1

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.

Comments: 11 pages
Categories: math.LO
Subjects: 03E02, 03E10
Related articles: Most relevant | Search more
arXiv:1704.03898 [math.LO] (Published 2017-04-12)
Forcing in Ramsey theory
arXiv:math/0305241 [math.LO] (Published 2003-05-16, updated 2004-06-24)
Fraisse Limits, Ramsey Theory, and Topological Dynamics of Automorphism Groups
arXiv:1309.1430 [math.LO] (Published 2013-09-05)
Amenability and Ramsey theory in the metric setting

Links

Toolbox