A note on Ramsey numbers for minors
Maria Axenovich, Raphael Steiner

TL;DR
This paper determines the minimal size of complete graphs needed to guarantee monochromatic minors of a given graph or clique under two-color and multi-color edge colorings, extending previous asymptotic results.
Contribution
It provides exact asymptotic formulas for Ramsey numbers for minors with two colors and extends to multiple colors, generalizing prior asymptotic bounds.
Findings
Exact asymptotic formula for R_h(F;2) for large graphs.
Asymptotic behavior of R_h(k; \, ext{colors}) for large k and \, ext{colors}.
Extension of previous bounds to more colors and general graphs.
Abstract
Let be the smallest integer such that any edge coloring of a complete graph on vertices in colors results in a monochromatic -minor, in other words, a graph with Hadwiger number , i.e., a graph that could be transformed into a clique on vertices via a sequence of edge contractions and vertex deletions. More generally, for a graph and integer let be the smallest integer such that any edge coloring of a complete graph on vertices in colors results in a monochromatic -minor. In 2001 Thomason and in 2005 Myers and Thomason asymptotically determined the extremal numbers for clique minors and -minors, respectively. They found the respective explicitly computable leading constants and for these extremal numbers. We determine for every graph …
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
