Metraipolis › archive › dc_a2f2b3ea8992
The symbolic pfaffian method I: A generalization of the Gallucio-Loebl-Tesler Theorem — arXiv:2611.00468
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00468
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:49:27.199Z
- SHA-256 of the archived text
e2905c80aa30ea7f0673a89912c463c0b1a2a978fe815b7b168c5060344b0a56- Stable URL of this page
https://metraipolis.com/documento/dc_a2f2b3ea8992
How to cite
The symbolic pfaffian method I: A generalization of the Gallucio-Loebl-Tesler Theorem — arXiv:2611.00468 — arXiv (en), https://arxiv.org/abs/2611.00468 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2f2b3ea8992 (Metraipolis archive dc_a2f2b3ea8992, sha256 e2905c80aa30ea7f0673a89912c463c0b1a2a978fe815b7b168c5060344b0a56)
BibTeX
@misc{dca2f2b3ea8992,
title = {The symbolic pfaffian method I: A generalization of the Gallucio-Loebl-Tesler Theorem — arXiv:2611.00468},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00468},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2f2b3ea8992; sha256 e2905c80aa30ea7f0673a89912c463c0b1a2a978fe815b7b168c5060344b0a56},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00468. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The pfaffian number of a graph $G$, denoted by $\mathrm{pf}(G)$, is the minimum integer $k$ such that the generating function of perfect matchings of $G$ can be written as a linear combination of $k$ pfaffians of signed adjacency matrices. The Galluccio-Loebl-Tesler Theorem states that $\mathrm{pf}(G) \leq 4^g$, where $g$ is the orientable genus of $G$. We generalize this theorem by relating the pfaffian number of a graph to another graph parameter: the symbolic pfaffian number, denoted by $\mathrm{spf}(G)$. Namely, we prove that $\mathrm{pf}(G) \leq 2^{\mathrm{spf}(G)}$. Our proof is based on linear algebra arguments and does not depend on topological properties of graphs. As a consequence of our generalization, we conclude that $\mathrm{pf}(K_{2n}) = 2^{\mathcal{O}(n \log n)}$, an improvement on the previous upper bound of $4^{\mathcal{O}(n^2)}$ based on the genus. We also consider lower bounds for $\mathrm{pf}(G)$ related to $\mathrm{spf}(G)$. In particular, we show that the graphs with $\mathrm{pf}(G) = 4$ are the graphs with $\mathrm{spf}(G) = 2$. On the other hand, we show that our main result is strictly more general than a previous generalization by Norine.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2611.00468 — 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-11-03T18:15:38.042Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).