Scott's odd induced subgraph conjecture is confirmed for claw-free graphs, disproved for K_{1,r}-free graphs with r>=4, and a related line-graph problem is resolved with C5 as the smallest counterexample.
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 Scott's odd induced subgraph conjecture and a related problem
Scott's odd induced subgraph conjecture is confirmed for claw-free graphs, disproved for K_{1,r}-free graphs with r>=4, and a related line-graph problem is resolved with C5 as the smallest counterexample.