Pages that link to "Item:Q674615"

The following pages link to The complete intersection theorem for systems of finite sets (Q674615):

Displaying 50 items.

• Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
• Intersection problems in the \(q\)-ary cube (Q272323) (← links)
• EKR sets for large \(n\) and \(r\) (Q292246) (← links)
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities (Q295831) (← links)
• Some bounds for the number of blocks. III. (Q297934) (← links)
• Linear independence, a unifying approach to shadow theorems (Q298330) (← links)
• Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code (Q326314) (← links)
• The eigenvalue method for cross \(t\)-intersecting families (Q372837) (← links)
• Deterministic quantum non-locality and graph colorings (Q387022) (← links)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
• Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
• A short proof of an Erdős-Ko-Rado theorem for compositions (Q400403) (← links)
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932) (← links)
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
• Hypergraphs with many Kneser colorings (Q412274) (← links)
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families (Q458297) (← links)
• New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← links)
• Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces (Q491543) (← links)
• Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
• Union-intersecting set systems (Q497346) (← links)
• On the stability of the Erdös-Ko-Rado theorem (Q498190) (← links)
• A sharp bound for the product of weights of cross-intersecting families (Q504984) (← links)
• An intersection theorem for systems of finite sets (Q516775) (← links)
• On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
• Around the complete intersection theorem (Q516788) (← links)
• Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families (Q516792) (← links)
• The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
• Set systems without a simplex or a cluster (Q532128) (← links)
• A product version of the Erdős-Ko-Rado theorem (Q533340) (← links)
• Stability for \(t\)-intersecting families of permutations (Q616451) (← links)
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (Q729778) (← links)
• Invitation to intersection problems for finite sets (Q739389) (← links)
• Strongly intersecting integer partitions (Q740661) (← links)
• Maximum hitting for \(n\) sufficiently large (Q742567) (← links)
• Intersection theorem for finite permutations (Q764250) (← links)
• Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\) (Q830936) (← links)
• Pairwise intersections and forbidden configurations (Q850074) (← links)
• The maximum size of 3-wise \(t\)-intersecting families (Q854817) (← links)
• EKR type inequalities for 4-wise intersecting families (Q880003) (← links)
• On the structure of distance graphs with large chromatic numbers (Q881128) (← links)
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
• Intersection theorems for multisets (Q896069) (← links)
• A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
• The edge-diametric theorem in Hamming spaces (Q947095) (← links)
• Size of downsets in the pushing order and a problem of Berlekamp (Q947102) (← links)
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
• On the measure of intersecting families, uniqueness and stability (Q963246) (← links)
• Cross \(\mathcal L\)-intersecting families on set systems (Q965946) (← links)
• Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
• Circular coloring and Mycielski construction (Q968430) (← links)