Regular intersecting families

DOI10.1016/J.DAM.2019.07.009MaRDI QIDQ2334049zbMATH OpenOpenAlexFDO

Authors Ferdinand Ihringer, Andrey B. Kupavskii

Publication date 6 November 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.10462, https://biblio.ugent.be/publication/8662762

zbMATH Keywords

1-designEKR theoremHoffman's boundintersecting familyJohnson scheme

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $mathcalF$ of $k$-element subsets of $[n]:=1,ldots,n,$ such that every element of $[n]$ lies in the same (or approximately the same) number of members of $mathcalF$. In particular, we show that we can guarantee $|mathcalF|=o(n-1choosek-1)$ if and only if $k=o(n)$.

Recommendations

• scientific article; zbMATH DE number 3983168
• Non-trivial intersecting families
• Regular bipartite graphs and intersecting families
• On regular 3-wise intersecting families
• On symmetric intersecting families
• Uniformly cross intersecting families
• Almost Intersecting Families of Sets
• Multiply-intersecting families
• Non-trivial r-wise intersecting families
• Circulant almost cross intersecting families

Cites work

• Covering pairs by q^ 2+q+1 sets
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Erdős-Ko-Rado theorems. Algebraic approaches
• Every monotone graph property has a sharp threshold
• Finite projective spaces and intersecting hypergraphs
• scientific article; zbMATH DE number 3743256 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3616474 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Intersecting Families are Essentially Contained in Juntas
• Intersecting families of finite sets and fixed-point-free 2-elements
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Maximum degree and fractional matchings in uniform hypergraphs
• On t-designs
• On the stability of some Erdős-Ko-Rado type results
• On the stability of the Erdős-Ko-Rado theorem
• On the stability of the independence number of a random subgraph
• Regular bipartite graphs and intersecting families
• Set systems without a simplex or a cluster
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The junta method in extremal hypergraph theory and Chvátal's conjecture
• The Non-Existence of Finite Projective Planes of Order 10
• The Nonexistence of Certain Finite Projective Planes

Cited in

(16)

• The unbalance of set systems
• 1-intersecting families
• Regular bipartite graphs and intersecting families
• An Erdős-Ko-Rado theorem for regular intersecting families of octads
• Maximal intersecting families
• On symmetric intersecting families
• Bounds on Borsuk numbers in distance graphs of a special type
• On stability of the independence number of a certain distance graph
• Chain intersecting families
• Intersecting families of finite sets and fixed-point-free 2-elements
• On regular 3-wise intersecting families
• scientific article; zbMATH DE number 3983168 (Why is no real title available?)
• Diversity
• Intersecting balanced families of sets
• On the intersecting family process
• On a d-degree Erdős-Ko-Rado theorem

This page was built for publication: Regular intersecting families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334049)