Metraipolis › archive › dc_64bd883ea6d9

Ramsey-type results for threshold graphs and beyond — arXiv:2608.22350

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22350
License (as archived)
CC0-1.0
Archived
2026-10-18T08:32:13.944Z
SHA-256 of the archived text
1123d94ece6f50f7dda0f77f8cf695c91043f7041ae783639bd870eb078b3042
Stable URL of this page
https://metraipolis.com/documento/dc_64bd883ea6d9

How to cite

Ramsey-type results for threshold graphs and beyond — arXiv:2608.22350 — arXiv (en), https://arxiv.org/abs/2608.22350 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_64bd883ea6d9 (Metraipolis archive dc_64bd883ea6d9, sha256 1123d94ece6f50f7dda0f77f8cf695c91043f7041ae783639bd870eb078b3042)
BibTeX
@misc{dc64bd883ea6d9,
  title = {Ramsey-type results for threshold graphs and beyond — arXiv:2608.22350},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22350},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_64bd883ea6d9; sha256 1123d94ece6f50f7dda0f77f8cf695c91043f7041ae783639bd870eb078b3042},
  year = {2026}
}

Archived text

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

A {\it threshold graph} is a graph that can be constructed from the one-vertex graph by repeatedly adding either a dominating vertex or an isolated vertex. Motivated by an induced Ramsey-type problem for this class, we define $r'_2(s)$ to be the minimum integer $n$ such that every $n$-vertex graph contains an induced threshold graph on $s$ vertices. We establish exponential upper and lower bounds for $r'_2(s)$ and determine its exact values for $s\in\{3,4,5,6\}$. To study this problem from an edge-coloring perspective, we use the notion of an orderable coloring, introduced by Richer [{\it J. Combin. Theory Ser. B}, 80(1) (2000), 172--177]. An edge-colored graph is {\it orderable} if its vertices can be ordered so that, for each vertex, all edges from it to later vertices have the same color. Equivalently, $r'_2(s)$ is the minimum $n$ such that every $2$-edge-coloring of $K_n$ contains an orderable $K_s$. We also determine the exact value of the unordered canonical Ramsey number $CR(s, 3)$ for all $s \ge 3$, where $CR(s,3)$ denotes the minimum integer $n$ such that every edge-coloring of $K_n$ contains either an orderable $K_s$ or a rainbow $K_3$. More generally, for graphs $G$ and $H$, we study $r'_2(G)$, the corresponding $2$-color Ramsey number for an orderable $G$, and $CR(G,H)$, where the alternative is a rainbow $H$. For complete bipartite graphs, we prove that for every fixed $s$, $r'_2(K_{s,t}) = CR(K_{s,t}, K_3)= \left(\frac{2^s}{s+1}+o(1)\right)t$ as $t\to\infty$. For $s\in \{2,3\}$, we further determine the exact values of these parameters for infinitely many $t$, using constructions arising from strongly regular graphs, Hadamard matrices and conference matrices.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22350 — 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-18T08:27:54.408Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).