Year: 2026
Type: preprint
Abstract: We prove that for every integers $d \ge 1$ and $s\ge2$ there exists an integer $D$, that depends only on $d$ and $s$, such that for every graph $P$ with maximum degree at most $ d$, there is a graph $H$ with maximum degree at most $D$ in which every $s$-coloring of $V(H)$ yields a monochromatic subdivision of $P$.
Source: arXiv (Cornell University)
Authors: Collado, Gabriel, Mubayi, Dhruv
Institution: University of Illinois Chicago
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W7206163023