Packing cliques in 3‐uniform hypergraphs

DOI10.1002/jcd.21717OpenAlexW3017408299MaRDI QIDQ6187456

Unnamed Author, Unnamed Author, Ramin Javadi

Publication date: 31 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21717

zbMATH Keywords

hypergraphgroup divisible designlarge set\(t\)-packing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The completion determination of optimal \((3,4)\)-packings
• On a packing and covering problem
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Covering graphs: The covering problem solved
• Packing graphs: The packing problem solved
• Explicit estimates of some functions over primes
• Covering and packing for pairs
• Asymptotic determination of the last packing number of quadruples
• On Quadruple Systems
• The spectrum for large sets of ‐GDDs of type
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

This page was built for publication: Packing cliques in 3‐uniform hypergraphs