← All problems

The Evasiveness conjecture for vertex-transitive graphs

17 years old · traced to

Let XX be a graph. Write D∞D_{\infty} for the class of graphs that are kk-dismantlable for some finite kk; equivalently, XX is non-evasive when X∈D∞X\in D_{\infty}. A graph is vertex-transitive if its automorphism group acts transitively on its vertices.

Evasiveness conjecture for graphs. If X∈D∞X\in D_{\infty} and XX is vertex-transitive, then XX is a complete graph.

This is the graph-theoretic restriction of the Evasiveness Conjecture for vertex-homogeneous simplicial complexes to clique complexes. The supplied text gives no evidence that the conjecture has been resolved.

References

2 papers in this index state this conjecture (2009–2019). The statement above is taken from the most recent of them; the others are arXiv:0907.2954.

Source: Etienne Fieux and Bertrand Jouve, “A hierarchy of dismantlings in Graphs”, arXiv:1902.04508 (2020).

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.