The structure of large intersecting families
From MaRDI portal
Abstract: A collection of sets is {em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of -sets of an -set whose size is quite a bit smaller than the maximum given by the ErdH os-Ko-Rado Theorem. In particular, this extends the Hilton-Milner theorem on nontrivial intersecting families and answers a recent question of Han and Kohayakawa for large . In the case we describe the structure of all intersecting families with more than 10 edges. We also prove a stability result for the Erdos matching problem. Our short proofs are simple applications of the Delta-system method introduced and extensively used by Frankl since 1977.
Recommendations
- Structure and supersaturation for intersecting families
- On the union of intersecting families
- Multiply-intersecting families revisited
- On cross-intersecting families
- Multiply-intersecting families
- Structural results for conditionally intersecting families and some applications
- On the kernel of intersecting families
- A note on large H-intersecting families
- Size and structure of large \((s,t)\)-union intersecting families
- The structure of large non-trivial \(t\)-intersecting families of finite sets
Cites work
- A Combinatorial Theorem
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- Hypergraph Turán numbers of linear cycles
- Improved bounds for Erdős' matching conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Linear trees in uniform hypergraphs
- On Erdős' extremal problem on matchings in hypergraphs
- On families of finite sets no two of which intersect in a singleton
- On intersecting families of finite sets
- On intersecting families of finite sets
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- The size of a hypergraph and its matching number
Cited in
(37)- A degree version of the Hilton-Milner theorem
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- Tight bounds for Katona's shadow intersection theorem
- Stability on matchings in 3-uniform hypergraphs
- Size and structure of large \((s,t)\)-union intersecting families
- Application of hypergraph Hoffman's bound to intersecting families
- Non-trivial \(d\)-wise intersecting families
- Intersecting families of discrete structures are typically trivial
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Degree versions of theorems on intersecting families via stability
- Structure and supersaturation for intersecting families
- On shadows of intersecting families
- Non-trivial t-intersecting families for symplectic polar spaces
- Intersecting Families are Essentially Contained in Juntas
- scientific article; zbMATH DE number 5535209 (Why is no real title available?)
- A hierarchy of maximal intersecting triple systems
- Nontrivial t-intersecting families for vector spaces
- On the multicolor Ramsey number for 3-paths of length three
- Hypergraphs without non-trivial intersecting subgraphs
- Stability of intersecting families
- The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes
- Large non-trivial \(t\)-intersecting families of signed sets
- Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families
- A generalization of diversity for intersecting families
- Short proofs of three results about intersecting systems
- Stabilities for non-uniform t-intersecting families
- Intersecting families of polynomials over finite fields
- Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms
- Intersecting families of 3-sets
- Intersecting families with covering number 3
- Hilton-Milner theorem for k-multisets
- Maximal intersecting families revisited
- Proof of Frankl's conjecture on cross-intersecting families
- Structure of non-trivial intersecting families
- Erdős-Ko-Rado theorem and Hilton-Milner type theorem for k-partitions
This page was built for publication: The structure of large intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970053)
