Metraipolis › archive › dc_e3db47c50fbe

Star-critical Ramsey numbers involving large generalized books — arXiv:2610.11151

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11151
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:01.494Z
SHA-256 of the archived text
e7d6efa93a49b1bf41502ebbd98311aa2afc1f54492e82ddfde8b4c8fd46d327
Stable URL of this page
https://metraipolis.com/documento/dc_e3db47c50fbe

How to cite

Star-critical Ramsey numbers involving large generalized books — arXiv:2610.11151 — arXiv (en), https://arxiv.org/abs/2610.11151 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e3db47c50fbe (Metraipolis archive dc_e3db47c50fbe, sha256 e7d6efa93a49b1bf41502ebbd98311aa2afc1f54492e82ddfde8b4c8fd46d327)
BibTeX
@misc{dce3db47c50fbe,
  title = {Star-critical Ramsey numbers involving large generalized books — arXiv:2610.11151},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11151},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e3db47c50fbe; sha256 e7d6efa93a49b1bf41502ebbd98311aa2afc1f54492e82ddfde8b4c8fd46d327},
  year = {2026}
}

Archived text

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

For graphs $F$, $G$, and $H$, we write $F \to (G, H)$ if every red/blue edge-coloring of $F$ contains either a red copy of $G$ or a blue copy of $H$. The Ramsey number $R(G, H)$ is the smallest integer $N$ such that $K_N \to (G, H)$. Let $H := K_k + nK_h$ be the generalized book graph, and let $G := K_{p+1}(a_1, a_2, \dots, a_{p+1})$ be a complete $(p+1)$-partite graph satisfying $a_1 = 1$, $a_2 \mid (nh-1)$, and $a_i \le a_{i+1}$. In this paper, avoiding the use of Szemerédi's regularity lemma, we prove that for any fixed $h, p \ge 1$, $k \ge 2$, and sufficiently large $n$, $K_{p(nh + a_2k - 1) + 1} \setminus K_{1, nh - a_2(h-2) - 1}\to(G, H).$ This result yields the star-critical Ramsey number $r_*(G, H) = (p-1)(nh + a_2k - 1) + a_2(k + h - 2) + 1.$

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.11151 — 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-09T05:53:57.186Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).