Metraipolis › archive › dc_3fc0ca16981c

Fort Abundance in Zero Forcing — arXiv:2609.11754

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11754
License (as archived)
CC0-1.0
Archived
2026-10-16T06:14:00.779Z
SHA-256 of the archived text
74f756868246c92dd7b51156e5d3be0b2c6e61ebb1126203286922290ac01b53
Stable URL of this page
https://metraipolis.com/documento/dc_3fc0ca16981c

How to cite

Fort Abundance in Zero Forcing — arXiv:2609.11754 — arXiv (en), https://arxiv.org/abs/2609.11754 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3fc0ca16981c (Metraipolis archive dc_3fc0ca16981c, sha256 74f756868246c92dd7b51156e5d3be0b2c6e61ebb1126203286922290ac01b53)
BibTeX
@misc{dc3fc0ca16981c,
  title = {Fort Abundance in Zero Forcing — arXiv:2609.11754},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11754},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3fc0ca16981c; sha256 74f756868246c92dd7b51156e5d3be0b2c6e61ebb1126203286922290ac01b53},
  year = {2026}
}

Archived text

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

This paper paper concerns the study of forts, the sets that obstruct zero forcing. We show that every block graph on $n$ vertices has at least $n/3$ minimal forts, extending a recent bound for trees by Cameron and and Li ( arXiv:2512.12874 ). The number of forts, and with it the number of compatible collections, grows exponentially for every tree, every connected non-star graph of bounded degree, and every connected graph of linear minimum degree, answering a question in the negative by Hicks et al. (INFORMS Journal on Computing 2022) for these graph classes. We finish by counting the minimal forts of a tree exactly, in linear time and space.

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