Packing nearly-disjoint sets
From MaRDI portal
Publication:1168975
DOI10.1007/BF02579285zbMath0494.05015MaRDI QIDQ1168975
Publication date: 1982
Published in: Combinatorica (Search for Journal in Brave)
05C65: Hypergraphs
05A05: Permutations, words, matrices
05B30: Other designs, configurations
05C15: Coloring of graphs and hypergraphs
05B40: Combinatorial aspects of packing and covering
Related Items
A sharpening of Fisher's inequality, Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors, A fractional version of the Erdős-Faber-Lovász conjecture