An intersection theorem for four sets
Recently the author [J. Comb. Theory, Ser. A 113, 547--550 (2006; Zbl 1088.05041)] conjectured that if \(r\geq d\geq 3\), \(\mathcal F\subseteq\{A\subseteq\{1,\dots,n\}: | A| =r\}\), and for any distinct \(A_1,\dots,A_d\in\mathcal F\) either \(| \bigcup_{i=1}^dA_i| >2r\) or \(\bigcap_{i=1}^d A_i\not=\emptyset\), then \(| \mathcal F| \leq\binom{n-1}{r-1}\) (and equality holds only if \(\bigcap_{F\in \mathcal F}F\not=\emptyset\)) provided that \(n\) is sufficiently large (e.g., \(n\geq rd/(d-1)\)). In the case \(d=3\), this was essentially proved by \textit{P. Frankl} and \textit{Z. Füredi} [Combinatorica 3, 341--349 (1983; Zbl 0529.05001)]. In the paper under review, the author confirms the conjecture for \(d=4\). The proof needs an auxiliary stability result.
- 4-books of three pages
- A hypergraph extension of the bipartite Turán problem
- A new generalization of the Erdős-Ko-Rado theorem
- Erdős--Ko--Rado for three sets
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Forbidding just one intersection
- Graph Theory and Probability
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3557819 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- Hypergraphs in which all disjoint pairs have distinct unions
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a hypergraph Turán problem of Frankl
- On Triple Systems with Independent Neighbourhoods
- Proof of a conjecture of Erdős on triangles in set-systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Structure and stability of triangle-free set systems
- The number of graphs without forbidden subgraphs
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- Set systems with union and intersection constraints
- Two-regular subgraphs of hypergraphs
- Sparse hypergraphs with low independence number
- On set systems without a simplex-cluster and the junta method
- On the \(d\)-cluster generalization of Erdős-Ko-Rado
- Structural results for conditionally intersecting families and some applications
- New results on simplex-clusters in set systems
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- d-cluster-free sets with a given matching number
- Multiply-intersecting families revisited
- Unavoidable subhypergraphs: a-clusters
- Simplex stability
- On Mubayi's conjecture and conditionally intersecting sets
- Turán problems and shadows. I: Paths and cycles
- A structural result for 3-graphs
- Set systems without a simplex or a cluster
- A product version of the Erdős-Ko-Rado theorem
- Uniform hypergraphs under certain intersection constraints between hyperedges
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- The maximum size of intersecting and union families of sets
- 3-cluster-free families of subspaces
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
This page was built for publication: An intersection theorem for four sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383002)
