Exactly Colored Complete Subgraphs of Infinite Graphs
\v{Z}arko Ran{\dj}elovi\'c

TL;DR
This paper investigates the existence of exactly colored infinite subgraphs within infinite graphs, proving that for large enough subgraph sizes, the conjecture holds for all larger color counts, reducing the problem to finitely many cases.
Contribution
It demonstrates that for sufficiently large subgraph sizes, the conjecture is true for all larger numbers of colors, simplifying the verification process.
Findings
The conjecture holds for all large enough m and all c > m.
Reduces the problem to finitely many cases for verification.
Extends previous results by Stacey and Weidl.
Abstract
Given integers and an exact -coloring of the edges of a complete countably infinite graph (i.e. a coloring that uses exactly colors), must there be an infinite subgraph that is exactly -colored? Using the Infinite Ramsey Theorem It is easy to show that the statement is true if or . Erickson conjectured that it is false in all other cases. Stacey and Weidl proved that for each there is some large enough such that the conjecture is true for all pairs with . The main aim of this paper is to show that for all large enough the conjecture holds for all . This reduces the number of cases needed to fully verify the conjecture to a finite number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
