Maximal intersecting families
نویسندگان
چکیده
منابع مشابه
Maximal Intersecting Families of Finite Sets and «uniform Hjelmslev Planes
The following theorem is proved. The collection of lines of an n-uniform projective Hjelmslev plane is maximal when considered as a collectiion of mutually intersecting sets of equal cardinality.
متن کاملIsomorphism Classes of Maximal Intersecting Uniform Families Are Few
Denote by f(k,m) the number of isomorphism classes of maximal intersecting k-uniform families of subsets of [m]. In this note we prove the existence of a constant f(k) such that f(k,m) ≤ f(k) for all values of m.
متن کاملVoting Fairly: Transitive Maximal Intersecting Families of Sets
There are several applications of maximal intersecting families (MIFs) and different notions of fairness. We survey known results regarding the enumeration of MIFs, and we conclude the enumeration of the 207,650,662,008 maximal families of intersecting subsets of X whose group of symmetries is transitive for |X |<13. 2000 Academic Press
متن کاملChain Intersecting Families
Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if it does not contain chains A1 ( A2 ( · · · ( Ap and B1 ( B2 ( · · · ( Bq with Ap∩Bq = ∅. The maximum size of these families is determined in this paper. Similarly to the p = q = 1 special case (intersecting families) this depends on the notion of r-complementing-chain-pair-free families, where r = p + q − ...
متن کاملRegular Intersecting Families
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n] := {1, . . . , n}, such that every element of [n] lies in the same (or approximately the same) number of members of F . In particular, we show that we can guarantee |F| = o( ( n−1 k−1 ) ) if and only if k = o(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1995
ISSN: 0195-6698
DOI: 10.1016/0195-6698(95)90004-7