Every fork-free graph is perfectly weight divisible, confirming Sivaraman's conjecture and yielding chi(G) at most binomial(omega(G)+1,2) for every fork-free graph.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Every fork-free graph is perfectly weight divisible
Every fork-free graph is perfectly weight divisible, confirming Sivaraman's conjecture and yielding chi(G) at most binomial(omega(G)+1,2) for every fork-free graph.