New results on simplex-clusters in set systems
From MaRDI portal
Publication:2236657
DOI10.1007/S00493-020-4441-1zbMath1499.05603arXiv2001.01812OpenAlexW3109061622MaRDI QIDQ2236657
Publication date: 25 October 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.01812
extremal combinatorics\(d\)-cluster\(d\)-simlex\(d\)-simplex-clusterErdős-Chvátal \(d\)-simplex conjecture
Related Items (3)
Hypergraphs without non-trivial intersecting subgraphs ⋮ Triangles in intersecting families ⋮ Partitioning ordered hypergraphs
Cites Work
- Set systems without a simplex or a cluster
- The complete intersection theorem for systems of finite sets
- Invitation to intersection problems for finite sets
- Set systems with union and intersection constraints
- Exact solution of some Turán-type problems
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex
- On Sperner families satisfying an additional condition
- On set systems without a simplex-cluster and the junta method
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Proof of a conjecture of Erdős on triangles in set-systems
- Erdős--Ko--Rado for three sets
- An intersection theorem for four sets
- A simple proof of the Erdős-Chao Ko-Rado theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Extremal Set-Intersection Theorem
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: New results on simplex-clusters in set systems
