The structure of large non-trivial t-intersecting families for finite sets

2020/08/25 by Mengyu Cao, Cao, Mengyu, Benjian Lv +3 · 4 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Advanced Graph Theory Research

paper · pdf · doi:10.48550/arxiv.2008.10784

Abstract

In this paper, we describe the structure of maximal non-trivial uniform t-intersecting families with large size for finite sets. In the special case when t=1, our result gives rise to Kostochka and Mubayi's result in 2017.

Cited by

• Erdős-Ko-Rado theorem and Hilton-Milner type theorem for k-partitions
• Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms
• Cross-intersection theorems for uniform partitions of finite sets
• Generalizations of the Erdős Matching Conjecture for the t-Matching Number

Related

• Structure of non-trivial intersecting families
• Structure and properties of large intersecting families
• Structure and properties of large intersecting families
• Intersecting families of sets and permutations: a survey
• Non-trivially intersecting multi-part families