Packing cliques in 3‐uniform hypergraphs
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21717
Abstract: For positive integers n≥k≥t , a collection B of k ‐subsets of an n ‐set X is called a t ‐packing if every t ‐subset of X appears in at most one set in B… read more here.
Keywords: packing cliques; cliques uniform; uniform hypergraphs;