Hypergraphs that are tight for Ryser's conjecture

Examples for the paper N.Francetić, S.Herke, B.D.McKay and I.M.Wanless, On Ryser's conjecture for linear intersecting multipartite hypergraphs, European J. Combin.

(Some of this data was produced by my coauthor Brendan McKay)

Most of what we present on this page is some 8-partite intersecting hypergraphs that have covering number τ=7 and hence are tight for Ryser's conjecture. The format is that each line in a file represents one hypergraph. Each word represents one edge, with the i-th letter saying which vertex on side i the edge hits.

Back to data homepage.