Two-part Hilton–Milner conjecture for non-trivially intersecting families
Two-part Hilton–Milner conjecture for non-trivially intersecting families
Let and be disjoint sets with sizes and , and let denote the family of sets satisfying and . A family is intersecting if any two of its members have nonempty intersection, and non-trivially intersecting if it is intersecting but has no element common to every member. Two-part Hilton–Milner conjecture. If is a non-trivially intersecting subfamily of , then
|{\cal F}|\leq \max \left\{ \left( 1+{n_1-1\choose k-1}-{n_1-k-1\choose k-1}\right){n_2\choose \ell}, \left.{n_1\choose k}\left( 1+{n_2-1\choose \ell-1}-{n_2-\ell-1\choose \ell-1}\right) \right\}.This conjectures that the largest non-trivially intersecting families arise from the two constructions obtained by placing the distinguished element and the exceptional set entirely in or entirely in ; its status is not resolved in the source.
Sources & referencesView supporting material
Primary source
Gyula O. H. Katona, “A general 2-part Erdős-Ko-Rado theorem”, arXiv:1703.00287 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.