Graphs of treewidth k satisfy α_c(G) ≥ c/(c+k+1)n with matching upper-bound constructions; the bound improves to c/(c+k)n when c≤2 or k=1 and to 5/9 n when c=3 and k=2.
4 Boštjan Brešar, František Kardoš, Ján Katrenič, and Gabriel Semanišin
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Clustered independence and bounded treewidth
Graphs of treewidth k satisfy α_c(G) ≥ c/(c+k+1)n with matching upper-bound constructions; the bound improves to c/(c+k)n when c≤2 or k=1 and to 5/9 n when c=3 and k=2.