Metraipolis › archive › dc_70d075456bbb
Projective dimension of closed neighborhood hypergraphs via extended double covers — arXiv:2610.06556
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06556
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:52:44.989Z
- SHA-256 of the archived text
50962a72ddc3d066eaf6b6c4e5c37b7d9139fe17c04732e3b91b813940031793- Stable URL of this page
https://metraipolis.com/documento/dc_70d075456bbb
How to cite
Projective dimension of closed neighborhood hypergraphs via extended double covers — arXiv:2610.06556 — arXiv (en), https://arxiv.org/abs/2610.06556 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70d075456bbb (Metraipolis archive dc_70d075456bbb, sha256 50962a72ddc3d066eaf6b6c4e5c37b7d9139fe17c04732e3b91b813940031793)
BibTeX
@misc{dc70d075456bbb,
title = {Projective dimension of closed neighborhood hypergraphs via extended double covers — arXiv:2610.06556},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06556},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70d075456bbb; sha256 50962a72ddc3d066eaf6b6c4e5c37b7d9139fe17c04732e3b91b813940031793},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06556. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a finite and simple graph without isolated vertices. We investigate the projective dimension of the closed neighborhood hypergraph $\mathcal{N}[G]$ and its relationship with the Castelnuovo-Mumford regularity of the extended bipartite double cover $\mathfrak{B}_e(G)$ of $G$. We establish the general upper bound $\operatorname{prod-dim} (\mathcal{N}[G]) \leq \operatorname{reg}(\mathfrak{B}_e(G))$ for all graphs. Furthermore, we prove that the exact equalities $\operatorname{prod-dim} (\mathcal{N}[G]) = \operatorname{reg}(\mathfrak{B}_e(G)) =\alpha(G)$ hold when $G$ belongs to several prominent graph classes, including König-Egerváry (contains all bipartite graphs), cographs, co-chordal, chordal and comparability graphs, where $\alpha(G)$ denotes the independence number. Our method of proofs relies on connecting algebraic invariants to the underlying combinatorial structure of graphs through covering, domination and matching parameters, together with the use of homology tools.
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.06556 — 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-06T15:19:20.034Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).