The authors prove, with a proof gap, that every (fork, antifork∪K1)-free graph is perfectly divisible, implying χ(G) ≤ binom(ω(G)+1, 2).
Gy´ ar´ as, On Ramsey Covering-Numbers, Colloquium, Keszthely, 1973; dedicated to P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Perfect divisibility of (fork, antifork$\cup K_1$)-free graphs
The authors prove, with a proof gap, that every (fork, antifork∪K1)-free graph is perfectly divisible, implying χ(G) ≤ binom(ω(G)+1, 2).