Determines sharp extremal edge bounds and complete structural characterizations for 2-connected graphs avoiding cycles congruent to 1 mod 3 (and 2 mod 4), completing the general-case picture for k=3.
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 2-connected graphs without cycles of length 1 modulo 3
Determines sharp extremal edge bounds and complete structural characterizations for 2-connected graphs avoiding cycles congruent to 1 mod 3 (and 2 mod 4), completing the general-case picture for k=3.