For any non-decreasing function f with f(x)≥x, the minimum number of graphs satisfying χ≤f(ω) needed to cover a graph G equals ceil(log χ(G)/log f(ω(G))).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cover numbers by certain graph families
For any non-decreasing function f with f(x)≥x, the minimum number of graphs satisfying χ≤f(ω) needed to cover a graph G equals ceil(log χ(G)/log f(ω(G))).