Metraipolis › archive › dc_16c15b2fb91b
A matroid characterization of the combinatorially symmetric maximum nullity of a graph — arXiv:2611.01102
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01102
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:36:42.862Z
- SHA-256 of the archived text
884b6ba1812b0a692591e8b67ee872b6dcac828453550d1ae707b8a91bd88ee3- Stable URL of this page
https://metraipolis.com/documento/dc_16c15b2fb91b
How to cite
A matroid characterization of the combinatorially symmetric maximum nullity of a graph — arXiv:2611.01102 — arXiv (en), https://arxiv.org/abs/2611.01102 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_16c15b2fb91b (Metraipolis archive dc_16c15b2fb91b, sha256 884b6ba1812b0a692591e8b67ee872b6dcac828453550d1ae707b8a91bd88ee3)
BibTeX
@misc{dc16c15b2fb91b,
title = {A matroid characterization of the combinatorially symmetric maximum nullity of a graph — arXiv:2611.01102},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01102},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_16c15b2fb91b; sha256 884b6ba1812b0a692591e8b67ee872b6dcac828453550d1ae707b8a91bd88ee3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01102. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The graph parameter ${\mathrm N}(G)$ is the maximum nullity among all combinatorially symmetric matrices associated to a graph $G$. The zero forcing number ${\mathrm Z}(G)$ is a well-known upper bound for ${\mathrm N}(G)$, and a zero forcing set of $G$ is exactly a set that intersects each fort of the graph. So the zero forcing number can be defined as the size of a minimum set that intersects every fort of $G$. This paper provides a similar characterization of ${\mathrm N}(G)$ that is purely combinatorial, using a connection to matroid theory and collections of forts that are compatible in a certain sense. We provide several examples highlighting subtle differences among compatible collections of forts and how they relate to full spark matrices and matroids associated to $G$.
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/2611.01102 — 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-03T11:05:22.258Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).