Metraipolis › archive › dc_e26bca7d66bb
Graph Sensitivity of Cartesian Products with Matched Bridges — arXiv:2610.09483
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09483
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:43:57.558Z
- SHA-256 of the archived text
598fabe3f43eafa04418c205c0965924d7eca5baa6d71549b22ab6f9903c0dfe- Stable URL of this page
https://metraipolis.com/documento/dc_e26bca7d66bb
How to cite
Graph Sensitivity of Cartesian Products with Matched Bridges — arXiv:2610.09483 — arXiv (en), https://arxiv.org/abs/2610.09483 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e26bca7d66bb (Metraipolis archive dc_e26bca7d66bb, sha256 598fabe3f43eafa04418c205c0965924d7eca5baa6d71549b22ab6f9903c0dfe)
BibTeX
@misc{dce26bca7d66bb,
title = {Graph Sensitivity of Cartesian Products with Matched Bridges — arXiv:2610.09483},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09483},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e26bca7d66bb; sha256 598fabe3f43eafa04418c205c0965924d7eca5baa6d71549b22ab6f9903c0dfe},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09483. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$, let $f_t(G)$ denote the minimum of the maximum degree of an induced subgraph with $\alpha(G)+t$ vertices, where $\alpha(G)$ is the independence number, and write $f(G)=f_1(G)$. Huang's theorem gives $f(Q_k)\ge\lceil\sqrt{k}\rceil$ for the $k$-dimensional hypercube $Q_k$. We extend this lower bound to Cartesian products of $k$ bipartite graphs with perfect matchings and prove that equality holds when the factors are connected and each has a matched bridge. In particular, we prove that $f(T_1\Box\cdots\Box T_k)=\lceil\sqrt{k}\rceil$ whenever each $T_i$ is a tree with a perfect matching. We determine the sensitivity of every Cartesian product of paths, settling the even-path case left open by Zeng and Hou [J. Graph Theory 107 (2024), 169--180]. For these tree products, with $D=\lceil\sqrt{k}\rceil$, we also prove that $f_t(T_1\Box\cdots\Box T_k)=D$ whenever $1\le t\le 2^{D-\lceil\log_2D\rceil-1}$. When $t=2$, this equality holds for all $k\ge 2$, provided that at least one factor is not $K_2$. Matching cuts give an additional exact range for products of even-order paths. Finally, we prove that $f_2(Q_k)=\lceil\sqrt{k}\rceil$ for every $k\ge 2$ with $k\not\in \{4,9\}$, whereas $f_2(Q_4)=3$ and $3\le f_2(Q_9)\le 4$.
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.09483 — 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-08T12:17:00.185Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).