A Product Version of the Hilton-Milner-Frankl Theorem

2022/06/15 by Péter Frankl, Jian Wang, Frankl, Peter +1 · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2206.07217

openalex publication_date 2022/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Two families F,G of k-subsets of \1,2,…,n\ are called non-trivial cross t-intersecting if |F∩ G|≥ t for all F∈ F, G∈ G and |∩ \F\colon F∈ F\|

Cited by

• Cross-intersection theorems for uniform partitions of finite sets
• s-almost cross-t-intersecting families for finite sets

Related

• A Product Version of the Hilton-Milner Theorem
• A note on non-empty cross-intersecting families
• r-cross t-intersecting families via necessary intersection points
• Some intersection theorems for finite sets
• Non-empty pairwise cross-intersecting families