(k,t)-threshold-PCGs unify prior PCG generalizations, represent every graph when k=n, but form an asymptotically vanishing class for any fixed k and t, with strict separations from k-interval-PCGs.
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
-
On Threshold Compatibility Graphs
(k,t)-threshold-PCGs unify prior PCG generalizations, represent every graph when k=n, but form an asymptotically vanishing class for any fixed k and t, with strict separations from k-interval-PCGs.