On disjointly representable sets

DOI10.1007/BF02579155zbMath0534.05003OpenAlexW1973663311MaRDI QIDQ790112

János Pach, Peter Frankl

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Turán problemdelta-systemsextremal hypergraph problemsrepresentable systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items

Disjointly representing set systems, On saturation of Berge hypergraphs, On the VC-dimension of uniform hypergraphs, A uniform version of a theorem by Dvir and Moran, Counterexample to the Frankl-Pach conjecture for uniform, dense families, Set systems related to a house allocation problem, Unavoidable subhypergraphs: \(\mathbf a\)-clusters, Linear algebra methods for Forbidden configurations, MULTIVALUED GENERALIZATIONS OF THE FRANKL–PACH THEOREM, Shattered matchings in intersecting hypergraphs, Forbidding complete hypergraphs as traces, Ramsey numbers of Berge-hypergraphs and related structures, Matchings and covers in hypergraphs, Shattering-extremal set systems from Sperner families, Disjoint representability of sets and their complements, The VC-dimension of Sperner systems, Unavoidable subhypergraphs: a-clusters, Hypergraphs without a large star

Cites Work

• Unnamed Item
• Unnamed Item
• On the trace of finite sets
• On the number of sets in a null t-design
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• On the density of families of sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• On generalized graphs
• On coloring graphs to maximize the proportion of multicolored k-edges
• An extremal problem in graph theory
• On the theory of graphs