← All problems

Levit–Mandrescu conjecture on independence-equivalent well-covered trees

24 years old · traced to

Let GG be a connected graph, let TT be a well-covered tree, and let I(G,x)I(G,x) denote the independence polynomial of GG. Levit–Mandrescu conjecture. If

I(T,x)=I(G,x),I(T,x)=I(G,x),

then GG is a well-covered tree. The conjecture concerns whether independence-polynomial equivalence with a well-covered tree forces the other graph to share that structure; the paper later gives an infinite family of counterexamples, so the conjecture is refuted.

References

4 papers in this index state this conjecture (2002–2020). The statement above is taken from the most recent of them; the others are arXiv:1309.7673, arXiv:1008.2605, arXiv:math/0211036.

Source: Iain Beaton and Ben Cameron, “On the largest real root of the independence polynomial of a unicyclic graph”, arXiv:2006.05511 (2022).

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.