For the family of graphs H_t built from a t-vertex path with each edge replaced by a 3t-page book, h_{H_t}(n,1) < c(n,H_t) for infinitely many n, and the ratio can be made arbitrarily small for large t.
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
-
Strong counterexamples to a supersaturation question of Ma-Yuan
For the family of graphs H_t built from a t-vertex path with each edge replaced by a 3t-page book, h_{H_t}(n,1) < c(n,H_t) for infinitely many n, and the ratio can be made arbitrarily small for large t.