The association-scheme conjecture for the meet-table graphs on 15 points
The association-scheme conjecture for the meet-table graphs on 15 points
Let be the set of uniform -partitions of a -set. For each relevant meet-table isomorphism type, let be the graph on defined in the paper by adjacency of partitions with that type.
Association-scheme conjecture for 15 points. The graphs , for , form an association scheme on .
In this case the qualitative independence relation is represented by three graphs in the proposed scheme rather than by a single graph, motivating this conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Karen Meagher, “Covering arrays on graphs: qualitative independence graphs and extremal set partition theory”, arXiv:math/0701553 (2007).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.