The maximum-independent-set structure conjecture for qualitative independence graphs
The maximum-independent-set structure conjecture for qualitative independence graphs
Let be the qualitative independence graph, and for distinct let denote the independent set defined in the paper.
Maximum-independent-set structure conjecture. For all positive integers , every maximum independent set in is of the form for distinct .
This extends the corresponding result known for . If true, the structural description would support proving that is a core for every .
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
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.