24,879 research outputs found
Non-trivial intersecting uniform sub-families of hereditary families
For a family F of sets, let μ(F ) denote the size of a smallest set in F that is not a subset of any other set in F , and for any positive integer r, let F (r) denote the family of r-element sets in F . We say that a family A is of Hilton–Milner (HM) type if for some A ∈ A, all sets in A \ {A} have a common element x ̸∈ A and intersect A. We show that if a hereditary family H is compressed and μ(H) ≥ 2r ≥ 4, then the HM-type family {A ∈ H(r): 1 ∈ A, A∩[2,r+1] ̸= ∅}∪{[2,r+1]}is a largest non-trivial intersecting sub-family of H(r); this generalises a well-known result of Hilton and Milner. We demonstrate that for any r ≥ 3 and m ≥ 2r, there exist non-compressed hereditary families H with μ(H) = m such that no largest non-trivial intersecting sub-family of H(r) is of HM type, and we suggest two conjectures about the extremal structures for arbitrary hereditary families.peer-reviewe
Non-trivial 3-wise intersecting uniform families
A family of -element subsets of an -element set is called 3-wise
intersecting if any three members in the family have non-empty intersection. We
determine the maximum size of such families exactly or asymptotically. One of
our results shows that for every there exists such that if
and then the maximum size
is .Comment: 12 page
Counting Intersecting and Pairs of Cross-Intersecting Families
A family of subsets of is called {\it intersecting} if any
two of its sets intersect. A classical result in extremal combinatorics due to
Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family
of -subsets of . In this paper we study the following
problem: how many intersecting families of -subsets of are
there? Improving a result of Balogh, Das, Delcourt, Liu, and Sharifzadeh, we
determine this quantity asymptotically for and
. Moreover, under the same assumptions we also determine
asymptotically the number of {\it non-trivial} intersecting families, that is,
intersecting families for which the intersection of all sets is empty. We
obtain analogous results for pairs of cross-intersecting families
Intersecting families of discrete structures are typically trivial
The study of intersecting structures is central to extremal combinatorics. A
family of permutations is \emph{-intersecting} if
any two permutations in agree on some indices, and is
\emph{trivial} if all permutations in agree on the same
indices. A -uniform hypergraph is \emph{-intersecting} if any two of its
edges have vertices in common, and \emph{trivial} if all its edges share
the same vertices.
The fundamental problem is to determine how large an intersecting family can
be. Ellis, Friedgut and Pilpel proved that for sufficiently large with
respect to , the largest -intersecting families in are the trivial
ones. The classic Erd\H{o}s--Ko--Rado theorem shows that the largest
-intersecting -uniform hypergraphs are also trivial when is large. We
determine the \emph{typical} structure of -intersecting families, extending
these results to show that almost all intersecting families are trivial. We
also obtain sparse analogues of these extremal results, showing that they hold
in random settings.
Our proofs use the Bollob\'as set-pairs inequality to bound the number of
maximal intersecting families, which can then be combined with known stability
theorems. We also obtain similar results for vector spaces.Comment: 19 pages. Update 1: better citation of the Gauy--H\`an--Oliveira
result. Update 2: corrected statement of the unpublished Hamm--Kahn result,
and slightly modified notation in Theorem 1.6 Update 3: new title, updated
citations, and some minor correction
- …