Solving a conjecture of Sedlacek: Maximal edge sets in the 3-uniform sumset hypergraphs

DOI10.1016/0012-365X(94)90168-6zbMath0801.05052WikidataQ123196834 ScholiaQ123196834MaRDI QIDQ1322279

Nigel Martin

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphboundconjecture of Sedlacek

Mathematics Subject Classification ID

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

Cites Work

• On certain distributions of integers in pairs with given differences
• A Note on Steiner Triple Systems.
• On Steiner and Similar Triple Systems.
• ON A SET SYSTEM

This page was built for publication: Solving a conjecture of Sedlacek: Maximal edge sets in the 3-uniform sumset hypergraphs