The core conjecture for qualitative independence graphs

A graph is a core if every endomorphism is an automorphism. Let QI(k2,k)QI(k^2,k) be the qualitative independence graph.

Core conjecture. For any positive integer kk, the graph QI(k2,k)QI(k^2,k) is a core.

The case k=3k=3, namely QI(9,3)QI(9,3), is known by work cited in the paper. The conjecture asks for the analogous rigidity for all kk.

Sources & referencesView supporting material

Primary source

Karen Meagher, “Covering arrays on graphs: qualitative independence graphs and extremal set partition theory”, arXiv:math/0701553 (2007).

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.