The association-scheme conjecture for the meet-table graphs on 15 points

From papers

Let U315\mathcal{U}^{15}_3 be the set of uniform 33-partitions of a 1515-set. For each relevant meet-table isomorphism type, let GiG_i be the graph on U315\mathcal{U}^{15}_3 defined in the paper by adjacency of partitions with that type.

Association-scheme conjecture for 15 points. The graphs GiG_i, for i=2,,13i=2,\dots,13, form an association scheme on U315\mathcal{U}^{15}_3.

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

No solutions have been posted yet.