vix.ing · top · new · best · stats · spec

On the Erdős-Ko-Rado problem of flags with type \1, n-3 \ of finite sets

2025/06/25 by Heering, Philipp
#05C35 #05C69 #05D05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2506.20556

Abstract

A flag of a finite set S is a set f of non-empty, proper subsets of S, such that X⊆ Y or Y⊆ X for all X,Y∈ f. Two flags f1 and f2 of S are opposite if X1∩ X2=∅, or X1∪ X2=S for all X1∈ f1 and X2∈ f2. The set \|X| | X∈ f \ is the type of a flag f. A set of pairwise non-opposite flags is an Erdős-Ko-Rado set. In 2022 Metsch posed the problem of determining the maximum size of all Erdős-Ko-Rado sets of flags of type T with |T|=2. We contribute towards this by determining the maximum size for flags of type \ 1,n-3\ for finite sets with n elements. Furthermore we answer an open questions of Metsch regarding a small case.

Citations

Related