Metraipolis › archive › dc_827009772bc8

Hamilton-connected cores and five cycle--wheel Ramsey numbers — arXiv:2609.39508

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39508
License (as archived)
CC0-1.0
Archived
2026-10-07T14:19:07.264Z
SHA-256 of the archived text
2f99cef1c8bfc0b864dc272ea8cfac7e280082ad2a84ee614e744797028719a5
Stable URL of this page
https://metraipolis.com/documento/dc_827009772bc8

How to cite

Hamilton-connected cores and five cycle--wheel Ramsey numbers — arXiv:2609.39508 — arXiv (en), https://arxiv.org/abs/2609.39508 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_827009772bc8 (Metraipolis archive dc_827009772bc8, sha256 2f99cef1c8bfc0b864dc272ea8cfac7e280082ad2a84ee614e744797028719a5)
BibTeX
@misc{dc827009772bc8,
  title = {Hamilton-connected cores and five cycle--wheel Ramsey numbers — arXiv:2609.39508},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39508},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_827009772bc8; sha256 2f99cef1c8bfc0b864dc272ea8cfac7e280082ad2a84ee614e744797028719a5},
  year = {2026}
}

Archived text

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

Let $W_s=K_1+C_{s-1}$ denote the wheel on $s$ vertices. We give structural proofs that $R(C_{14},W_{11})=27$ and $R(C_{15},W_{11})=29$. Together with the theorem of Chen et al. for $n\ge16$, these equalities give $R(C_n,W_{11})=2n-1$ for every $n\ge14$. The two boundary values were included in an earlier survey announcement. We also give structural proofs of $R(C_8,W_7)=15$, $R(C_9,W_7)=17$, and $R(C_8,W_9)=15$. The common starting point is a Hamilton-connected core lemma. For the eleven-vertex wheel, bounds on vertex connectivity and on the matching number of a bipartite graph associated with a local cycle yield a vertex cut of order nine. Paths with prescribed endpoints then rule out every possible pair of orders of the two remaining vertex sets. For the smaller wheels, we use the structure of critical cycle colorings and local cycle-shortening arguments. We also give complete structural classifications of the $(C_8,C_6)$- and $(C_9,C_6)$-critical colorings, recovering the previously reported counts 24 and 26. All proofs are combinatorial and use no exhaustive graph enumeration.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.39508 — 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-07T14:05:16.435Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).