Perturbation of the largest matching root of hypergraphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918501699026944 |
|---|---|
| author | Wan, Jiang-Chao Wang, Yi |
| author_facet | Wan, Jiang-Chao Wang, Yi |
| contents | The largest matching root of a $k$-graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In this paper, we investigate the perturbation of the largest matching root of $k$-graphs. We determine all $k$-graphs whose largest matching root attains the maximum among all $k$-cacti and linear $k$-cacti with a given number of cycles and edges, where a $k$-cactus is a $k$-graph in which every two distinct cycles have at most one vertex in common. To achieve this, we prove that the celebrated shifting operation of $k$-graphs, introduced by Erdős, Ko and Rado, does not decrease the largest matching root. This result extends a classical result by Csikvári (Electron. J. Combin. {\bf 18} (2011) $\#$P182) stating that the Kelmans transformation does not decrease the largest matching root of graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14882 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Perturbation of the largest matching root of hypergraphs Wan, Jiang-Chao Wang, Yi Combinatorics The largest matching root of a $k$-graph is the largest real root of its matching polynomial, which is equal to the maximum modulus of all the zeros of the matching polynomial. In this paper, we investigate the perturbation of the largest matching root of $k$-graphs. We determine all $k$-graphs whose largest matching root attains the maximum among all $k$-cacti and linear $k$-cacti with a given number of cycles and edges, where a $k$-cactus is a $k$-graph in which every two distinct cycles have at most one vertex in common. To achieve this, we prove that the celebrated shifting operation of $k$-graphs, introduced by Erdős, Ko and Rado, does not decrease the largest matching root. This result extends a classical result by Csikvári (Electron. J. Combin. {\bf 18} (2011) $\#$P182) stating that the Kelmans transformation does not decrease the largest matching root of graphs. |
| title | Perturbation of the largest matching root of hypergraphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.14882 |