The core conjecture for qualitative independence graphs
The core conjecture for qualitative independence graphs
A graph is a core if every endomorphism is an automorphism. Let be the qualitative independence graph.
Core conjecture. For any positive integer , the graph is a core.
The case , namely , is known by work cited in the paper. The conjecture asks for the analogous rigidity for all .
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
Sign in to submit a solution.
No solutions have been posted yet.