Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 10 min ago
PreprintCC BY 4.0arXiv

Arboricity and Simplicial Geometric Category of Wedges and Joins of Graphs

  • Nursultan Kuanyshov
  • Islam Yeginbay
Open at sourcePDFDOICite

Abstract

We investigate the behavior of arboricity under two fundamental graph operations, namely wedges and joins, proving an exact formula for wedges and establishing general upper and lower bounds for joins. Using the characterization of the simplicial geometric category of connected graphs in terms of arboricity, we derive a wedge formula for simplicial geometric category and obtain corresponding estimates for graph joins. Finally, we illustrate these results through explicit computations for several classes of graphs by constructing forest decompositions and the associated covers by strongly collapsible subcomplexes.

Related

  1. DP vertex-arboricity of sparse graphs
    Peter Bradshaw, Alexandr Kostochka, Zimu Xiang
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Linear arboricity conjecture for infinite graphs
    Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Verdier-Type Category, Geometric Serre's conditions and perversity
    Shang Xu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Extending Goldberg's Exact Sequence to Braid Groups of Graphs and Simplicial Complexes
    Byung Hee An
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  5. Geometric triangle-free graphs of large chromatic number
    István Tomon
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{kuanyshov2026arboricity,
  title = {{Arboricity and Simplicial Geometric Category of Wedges and Joins of Graphs}},
  author = {Nursultan Kuanyshov and Islam Yeginbay},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.20606},
  eprint = {2609.20606},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.20606},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Arboricity and Simplicial Geometric Category of Wedges and Joins of Graphs
AU  - Nursultan Kuanyshov
AU  - Islam Yeginbay
PY  - 2026
DA  - 2026/09/17
PB  - arXiv
DO  - 10.48550/arxiv.2609.20606
UR  - https://arxiv.org/abs/2609.20606
AB  - We investigate the behavior of arboricity under two fundamental graph operations, namely wedges and joins, proving an exact formula for wedges and establishing general upper and lower bounds for joins. Using the characterization of the simplicial geometric category of connected graphs in terms of arboricity, we derive a wedge formula for simplicial geometric category and obtain corresponding estimates for graph joins. Finally, we illustrate these results through explicit computations for several classes of graphs by constructing forest decompositions and the associated covers by strongly collapsible subcomplexes.
ER  -