Shifting does not decrease the largest matching root of k-graphs, enabling identification of the maximum-attaining k-cacti with given cycles and edges.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Perturbation of the largest matching root of hypergraphs
Shifting does not decrease the largest matching root of k-graphs, enabling identification of the maximum-attaining k-cacti with given cycles and edges.