Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 23 min ago
PreprintarXiv licencearXiv

The DP color function of joins and vertex-gluing of hypergraphs

  • Ruiyi Cui
  • Liangxia Wan
  • Fengming Dong
Open at sourcePDFDOICite

Abstract

The DP color function PDP(ℋ, k) of a hypergraph ℋ is defined as the minimum possible value of PDP(ℋ, ℱ) taken over all k-fold covers ℱ of ℋ. It serves as an extension of the classical chromatic polynomial. In this paper, we investigate the DP color function for two constructions: the join of a hypergraph with a complete graph and vertex-gluings of certain hypergraphs. Both constructions extend some results of Becker et al.

Related

  1. Nullstellensatz degree under Hajós joins and vertex identifications
    Ying Xie
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Approximating Distributions on Vertex Degrees in Random Hypergraphs via Stein's Method
    Xianghe Zhu, Wenkai Xu, Gesine Reinert
    arXivPreprintCC BY 4.0Full textProbabilityStatisticsarXiv
  3. Spectral moments and characteristic polynomials of vertex expansion hypergraphs of graphs
    Ge Lin, Changjiang Bu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Conformal invariance of the six-vertex model's height function
    Emile Averous, Hugo Duminil-Copin, Tiancheng He +2
    arXivPreprintarXiv licenceFull textMathematical physicsProbabilityarXiv
  5. The giant component of complex hypergraphs: automated generating function calculations
    Alexei Vazquez
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsStatistical & nonlinear physicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{cui2026color,
  title = {{The DP color function of joins and vertex-gluing of hypergraphs}},
  author = {Ruiyi Cui and Liangxia Wan and Fengming Dong},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.13458},
  eprint = {2610.13458},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.13458},
}
RIS
TY  - UNPB
TI  - The DP color function of joins and vertex-gluing of hypergraphs
AU  - Ruiyi Cui
AU  - Liangxia Wan
AU  - Fengming Dong
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.13458
UR  - https://arxiv.org/abs/2610.13458
AB  - The DP color function P_DP(ℋ, k) of a hypergraph ℋ is defined as the minimum possible value of P_DP(ℋ, ℱ) taken over all k-fold covers ℱ of ℋ. It serves as an extension of the classical chromatic polynomial. In this paper, we investigate the DP color function for two constructions: the join of a hypergraph with a complete graph and vertex-gluings of certain hypergraphs. Both constructions extend some results of Becker et al.
ER  -