Conjecture on the additive gap between integral and fractional -clique covers
Conjecture on the additive gap between integral and fractional -clique covers
For a graph , let and denote its integral and fractional -clique cover numbers, respectively. Additive-gap conjecture. For every and every positive integer , there exists such that every graph on vertices satisfies
The preceding argument establishes an analogous asymptotic statement for the decomposition number, but the supplied text gives no resolution of this clique-cover conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
József Balogh, Jialin He, Robert A. Krueger, The Nguyen and Michael C. Wigal, “Clique covers and decompositions of cliques of graphs”, arXiv:2412.05522 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.