Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration

DOI10.1006/jcta.1998.2946zbMath0936.05084OpenAlexW2075524965MaRDI QIDQ1296753

Lucia Moura

Publication date: 28 May 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2946

zbMATH Keywords

family of subsetsintersecting familygenerating setspacking designkernelsessential setmaximal families

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Rank inequalities and separation algorithms for packing designs and sparse triple systems.

Cites Work

• Geometrical solution of an intersection problem for two hypergraphs
• Critical hypergraphs and interesting set-pair systems
• Finite projective spaces and intersecting hypergraphs
• On the kernel of intersecting families
• Multiply-intersecting families
• Interpolation of functions over a measure space and conjectures about memory
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• The complete nontrivial-intersection theorem for systems of finite sets
• A note on kernels of intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration