Metraipolis › archive › dc_63dbd6d0992d

Forcing monochromatic subdivisions — arXiv:2609.00636

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.00636
License (as archived)
CC0-1.0
Archived
2026-10-17T07:06:19.947Z
SHA-256 of the archived text
f5cb103c913feecb33fcc31e85b6990746556f69045d8975cf2cba412c013351
Stable URL of this page
https://metraipolis.com/documento/dc_63dbd6d0992d

How to cite

Forcing monochromatic subdivisions — arXiv:2609.00636 — arXiv (en), https://arxiv.org/abs/2609.00636 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_63dbd6d0992d (Metraipolis archive dc_63dbd6d0992d, sha256 f5cb103c913feecb33fcc31e85b6990746556f69045d8975cf2cba412c013351)
BibTeX
@misc{dc63dbd6d0992d,
  title = {Forcing monochromatic subdivisions — arXiv:2609.00636},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.00636},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_63dbd6d0992d; sha256 f5cb103c913feecb33fcc31e85b6990746556f69045d8975cf2cba412c013351},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00636. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.00636 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T06:52:59.681Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).