Closure of (strongly) sat-sharp graphs under disjoint union

Let H1H_1 and H2H_2 be graphs that are (strongly) sat-sharp, and let H1+H2H_1+H_2 denote their disjoint union. Disjoint-union conjecture. If H1H_1 and H2H_2 are (strongly) sat-sharp graphs, then H1+H2H_1+H_2 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

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.