The covering-number characterization of S-GQPQs
Let denote the set of triples under consideration, let be a subset of , and let . A set of triples has lines as hypergraph edges, and its covering number is the minimum number of lines whose union covers it.
The covering-number converse conjecture. If
then contains an -GQPQ.
This is proposed as the converse to the preceding necessary condition, giving a characterization of the existence of an -GQPQ by the covering number. The supplied text gives no resolution, so the conjecture remains open.
References
- L. Yu. Glebsky and C. J. Rubio, “Latin squares, partial latin squares and its generalized quotients”, arXiv:math/0303356 (2003).
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
No solutions have been posted yet.