On disjointly representable sets
From MaRDI portal
Publication:790112
DOI10.1007/BF02579155zbMath0534.05003MaRDI QIDQ790112
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Related Items
On the VC-dimension of uniform hypergraphs, Hypergraphs without a large star, The VC-dimension of Sperner systems, Counterexample to the Frankl-Pach conjecture for uniform, dense families, Matchings and covers in hypergraphs, Disjointly representing set systems, Forbidding complete hypergraphs as traces, Disjoint representability of sets and their complements
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