On disjointly representable sets

DOI10.1007/BF02579155zbMATH Open0534.05003OpenAlexW1973663311MaRDI QIDQ790112FDOQ790112

Authors: 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

Recommendations

• Disjointly representing set systems
• Intersection statements for systems of sets
• Simultaneous Systems of Representatives for Families of Finite Sets
• Hypergraphs in which all disjoint pairs have distinct unions
• Large \(s\)-representable set systems with low maximum degree

zbMATH Keywords

delta-systemsextremal hypergraph problemsrepresentable systemsTurán problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (23)

• Ramsey numbers of Berge-hypergraphs and related structures
• Set systems with few disjoint pairs
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Disjointly representing set systems
• Shattered matchings in intersecting hypergraphs
• Minimum number of elements of representing a set system of given rank
• Forbidding complete hypergraphs as traces
• On saturation of Berge hypergraphs
• Disjoint representability of sets and their complements
• Hypergraphs in which all disjoint pairs have distinct unions
• Multivalued generalizations of the Frankl-Pach theorem
• Title not available (Why is that?)
• The VC-dimension of Sperner systems
• Large \(s\)-representable set systems with low maximum degree
• Matchings and covers in hypergraphs
• A uniform version of a theorem by Dvir and Moran
• On the VC-dimension of uniform hypergraphs
• Set systems related to a house allocation problem
• Hypergraphs without a large star
• Linear algebra methods for Forbidden configurations
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Shattering-extremal set systems from Sperner families

This page was built for publication: On disjointly representable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790112)