Javadi–Maleki–Omoomi conjecture on local clique cover numbers

Let GG be a graph on nn vertices, and let lcc(G)\operatorname{lcc}(G) denote its local clique cover number. Let G\overline{G} be the complement of GG. Javadi–Maleki–Omoomi conjecture. For every graph GG on nn vertices,

lcc(G)+lcc(G)n.\operatorname{lcc}(G)+\operatorname{lcc}(\overline{G})\leq n.

This is a Nordhaus–Gaddum-type inequality for the local clique cover number. It was proposed by R. Javadi, Z. Maleki and B. Omoomi in 2012; the supplied source gives no resolution, so its status is open.

Sources & referencesView supporting material

Primary source

Csilla Bujtás, Akbar Davoodi, Ervin Győri and Zsolt Tuza, “Clique Coverings and Claw-free Graphs”, arXiv:1608.07686 (2016).

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.