Triangles in r-wise t-intersecting families
From MaRDI portal
Publication:6171503
Abstract: Let , , and be positive integers and a family of -subsets of an -set . The family is -wise -intersecting if for any , we have . An -wise -intersecting family of sets is called an -triangle if . In this paper, we prove that if , then the -wise -intersecting family containing the most -triangles is isomorphic to . This can also be regarded as a generalized Tur'{a}n type result.
Recommendations
Cites work
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Invitation to intersection problems for finite sets
- Non-trivial intersecting families
- On intersecting families of finite sets
- On the maximum number of distinct intersections in an intersecting family
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The structure of large non-trivial \(t\)-intersecting families of finite sets
Cited in
(6)- EKR type inequalities for 4-wise intersecting families
- Triangulation of refined families
- Families of integral cographs within a triangular array
- Triangles in intersecting families
- A condition for a family of triangles to be orientable to a cyclic order
- Structure and stability of triangle-free set systems
This page was built for publication: Triangles in \(r\)-wise \(t\)-intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171503)