Counterexample to the Frankl-Pach conjecture for uniform, dense families

DOI10.1007/BF01200912zbMath0886.05109OpenAlexW1964675587WikidataQ123281023 ScholiaQ123281023MaRDI QIDQ1382415

Levon H. Khachatrian

Publication date: 26 March 1998

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01200912

zbMATH Keywords

hypergraphsuniform familiesdense families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (7)

On the VC-dimension of uniform hypergraphs ⋮ Unavoidable subhypergraphs: \(\mathbf a\)-clusters ⋮ Linear algebra methods for Forbidden configurations ⋮ Disjoint representability of sets and their complements ⋮ The VC-dimension of Sperner systems ⋮ Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration ⋮ Unavoidable subhypergraphs: a-clusters

Cites Work

• On disjointly representable sets
• Density results for uniform families
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Counterexample to the Frankl-Pach conjecture for uniform, dense families