The conjecture on the complementary bounding function of the almost identity function
Let be the almost identity function
For a graph , let be its independence number and let be its minimum clique-cover number. The complementary bounding function is the optimal function bounding in terms of for graphs whose chromatic number is bounded by . The conjecture on .
The statement is suggested by the preceding upper bound and is presented as a conjectural formula; the supplied text gives no resolution, so it is recorded as open.
References
- András Gyárfás, Zhentao Li, Raphael Machado, András Sebo, Stéphan Thomassé and Nicolas Trotignon, “Complements of nearly perfect graphs”, arXiv:1304.2862 (2013).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.