Recommendations
Cites work
- scientific article; zbMATH DE number 3801568 (Why is no real title available?)
- scientific article; zbMATH DE number 3370377 (Why is no real title available?)
- An extremal problem in graph theory
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- On coloring graphs to maximize the proportion of multicolored k-edges
- On generalized graphs
- On the density of families of sets
- On the number of sets in a null t-design
- On the theory of graphs
- On the trace of finite sets
- Solution of a problem of A. Ehrenfeucht and J. Mycielski
Cited in
(23)- Shattering-extremal set systems from Sperner families
- 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
- On saturation of Berge hypergraphs
- Forbidding complete hypergraphs as traces
- Hypergraphs in which all disjoint pairs have distinct unions
- Disjoint representability of sets and their complements
- Multivalued generalizations of the Frankl-Pach theorem
- scientific article; zbMATH DE number 4089516 (Why is no real title available?)
- 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
- Hypergraphs without a large star
- Set systems related to a house allocation problem
- Linear algebra methods for Forbidden configurations
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
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)
