The following pages link to On disjointly representable sets (Q790112):
Displaying 24 items.
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Linear algebra methods for Forbidden configurations (Q653981) (← links)
- Hypergraphs in which all disjoint pairs have distinct unions (Q760430) (← links)
- On the VC-dimension of uniform hypergraphs (Q857750) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- The VC-dimension of Sperner systems (Q1296751) (← links)
- Large \(s\)-representable set systems with low maximum degree (Q1313861) (← links)
- Counterexample to the Frankl-Pach conjecture for uniform, dense families (Q1382415) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
- Disjointly representing set systems (Q1873809) (← links)
- Set systems with few disjoint pairs (Q1878795) (← links)
- On saturation of Berge hypergraphs (Q2122672) (← links)
- A uniform version of a theorem by Dvir and Moran (Q2166116) (← links)
- Set systems related to a house allocation problem (Q2182206) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- Ramsey numbers of Berge-hypergraphs and related structures (Q2278117) (← links)
- Shattering-extremal set systems from Sperner families (Q2309556) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Disjoint representability of sets and their complements (Q2565684) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q2851439) (← links)
- On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems (Q3360178) (← links)
- (Q3818290) (← links)
- MULTIVALUED GENERALIZATIONS OF THE FRANKL–PACH THEOREM (Q5389512) (← links)
