Graphs with vanishing Betti numbers β_{i,j}(I_G)=0 for fixed i,j have chromatic number at most a polynomial of degree 2j-2i-4 in the clique number ω.
On a property of the class ofn-colorable graphs.Journal of Combinatorial Theory B16, 191–193 (1974)
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
-
Chromatic numbers from edge ideals: Graph classes with vanishing syzygies are polynomially $\chi$-bounded
Graphs with vanishing Betti numbers β_{i,j}(I_G)=0 for fixed i,j have chromatic number at most a polynomial of degree 2j-2i-4 in the clique number ω.