For large n, the authors give the exact maximum edge count ex(n, {H,F}) for graphs avoiding both a linear forest H and a fixed graph F with chromatic number at least three.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tur\'an type problems for a fixed graph and a linear forest
For large n, the authors give the exact maximum edge count ex(n, {H,F}) for graphs avoiding both a linear forest H and a fixed graph F with chromatic number at least three.