Ramsey theory for highly connected monochromatic subgraphs
classification
🧮 math.LO
keywords
connectedhighlyedgesgraphramseysubgraphsassertingcolor
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.