MathDBThe covering-array nonexistence conjecture for parameters
The covering-array nonexistence conjecture for parameters
A covering array is an array with 12 rows, 8 columns, and alphabet size 3 such that every pair of columns contains every ordered pair of symbols.
Covering-array nonexistence conjecture. A does not exist; consequently,
The paper records the bounds and relates this conjecture to the proposed association scheme on .
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.