Bipartite Hansel results for hypergraphs

DOI10.1016/j.ejc.2020.103136zbMath1447.05146OpenAlexW3021475800MaRDI QIDQ2198970

Gregory Churchill, Brendan Nagle

Publication date: 15 September 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103136

zbMATH Keywords

degree-sequenceoptimal covers

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On separating systems whose elements are sets of at most k elements
• Density conditions for triangles in multipartite graphs
• On separating systems
• Improved bounds for covering complete uniform hypergraphs
• The covering problem of complete uniform hypergraphs
• Extremal Combinatorics
• Perfect Hashing and Probability
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On separating systems of a finite set
• Minimal completely separating systems
• On a problem concerning separating systems of a finite set
• Minimal completely separating systems of \(k\)-sets

This page was built for publication: Bipartite Hansel results for hypergraphs