Closure of (strongly) sat-sharp graphs under disjoint union
Closure of (strongly) sat-sharp graphs under disjoint union
Let and be graphs that are (strongly) sat-sharp, and let denote their disjoint union. Disjoint-union conjecture. If and are (strongly) sat-sharp graphs, then is (strongly) sat-sharp; equivalently, the class of (strongly) sat-sharp graphs is closed under taking disjoint unions. The preceding results establish this behavior for certain classes, including disjoint unions of cliques, but the general closure assertion is presented as plausible and remains open.
Sources & referencesView supporting material
Primary source
Alex Cameron and Gregory J. Puleo, “A lower bound on the saturation number, and graphs for which it is sharp”, arXiv:2004.05410 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.