Pages that link to "Item:Q3281090"

The following pages link to INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (Q3281090):

Displaying 50 items.

• New inequalities for families without \(k\) pairwise disjoint members (Q1747778) (← links)
• Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\) (Q1747780) (← links)
• \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
• Miklós-Manickam-Singhi conjectures on partial geometries (Q1752549) (← links)
• Partition-free families of sets (Q1752685) (← links)
• The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
• Coloring cross-intersecting families (Q1753012) (← links)
• Extremal numbers for directed hypergraphs with two edges (Q1753023) (← links)
• The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
• Erdős-Ko-Rado theorem for irreducible imprimitive reflection groups (Q1758575) (← links)
• Erdős-Ko-Rado with conditions on the minimum complementary degree (Q1763872) (← links)
• Random walks and multiply intersecting families (Q1763876) (← links)
• Compression and Erdős-Ko-Rado graphs (Q1779494) (← links)
• Graphs with the Erdős-Ko-Rado property (Q1779495) (← links)
• On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
• Matchings and covers in hypergraphs (Q1813100) (← links)
• An Erdős-Ko-Rado theorem for regular intersecting families of octads (Q1821104) (← links)
• The number of \(k\)-intersections of an intersecting family of \(r\)-sets (Q1826945) (← links)
• Multiply intersecting families of sets (Q1826948) (← links)
• Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
• NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
• On families of finite sets with bounds on unions and intersections (Q1837682) (← links)
• Extremal problems among subsets of a set (Q1843567) (← links)
• Sperner systems consisting of pairs of complementary subsets (Q1843568) (← links)
• Erdős-Ko-Rado from Kruskal-Katona (Q1845729) (← links)
• The \(t\)-intersection problem in the truncated Boolean lattice (Q1864563) (← links)
• Weighted 3-wise 2-intersecting families (Q1865384) (← links)
• A sharp bound for the number of sets that pairwise intersect at \(k\) positive values (Q1878792) (← links)
• Covering by intersecting families (Q1881681) (← links)
• Multicoloured extremal problems (Q1883144) (← links)
• Uniform intersecting families with covering number four (Q1894015) (← links)
• On two set-systems with restricted cross-intersections (Q1902973) (← links)
• Cross-intersecting families of finite sets (Q1903016) (← links)
• Breakdown points, breakdown probabilities, midpoint sensitivity curves, and optimization of stack filters (Q1911853) (← links)
• A result concerning two conjectures of Berge and Chvátal (Q1923483) (← links)
• The complete nontrivial-intersection theorem for systems of finite sets (Q1924241) (← links)
• Anzahl formulas of subspaces in symplectic spaces and their applications (Q1947093) (← links)
• Shadows and intersections in vector spaces (Q1957963) (← links)
• On cross \(t\)-intersecting families of sets (Q1957972) (← links)
• Unavoidable hypergraphs (Q1984522) (← links)
• On symmetric intersecting families (Q1987090) (← links)
• The feasible region of hypergraphs (Q1998756) (← links)
• The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space (Q2000643) (← links)
• Partitioning ordered hypergraphs (Q2005178) (← links)
• All 2-transitive groups have the EKR-module property (Q2005193) (← links)
• The Hilton-Milner theorem for attenuated spaces (Q2005708) (← links)
• An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
• Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
• On set systems without a simplex-cluster and the junta method (Q2010639) (← links)
• Extremal set theory for the binomial norm (Q2010646) (← links)