Pages that link to "Item:Q1226485"

The following pages link to On Sperner families satisfying an additional condition (Q1226485):

Displaying 50 items.

• On \(q\)-analogues and stability theorems (Q408961) (← links)
• A structural result for 3-graphs (Q512589) (← links)
• Set systems without a simplex or a cluster (Q532128) (← links)
• A product version of the Erdős-Ko-Rado theorem (Q533340) (← links)
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
• Invitation to intersection problems for finite sets (Q739389) (← links)
• EKR type inequalities for 4-wise intersecting families (Q880003) (← links)
• Coding for a multiple access OR channel: A survey (Q947083) (← links)
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
• Extremal problems concerning Kneser-graphs (Q1057858) (← links)
• Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
• Polytopes determined by hypergraph classes (Q1073043) (← links)
• Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
• Exact solution of some Turán-type problems (Q1112819) (← links)
• Some results on Sperner families (Q1132876) (← links)
• On Sperner families in which no k sets have an empty intersection (Q1134158) (← links)
• Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions (Q1151395) (← links)
• On Sperner families in which no k sets have an empty intersection. II (Q1157326) (← links)
• On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex (Q1159695) (← links)
• On Sperner families in which no k sets have an empty intersection. III (Q1167724) (← links)
• On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
• More complete intersection theorems (Q1618227) (← links)
• On the Erdős-Ko-Rado theorem and the Bollobás theorem for \(t\)-intersecting families (Q1631618) (← links)
• Clone-induced approximation algebras of Bernoulli distributions (Q1714472) (← links)
• Random walks and multiply intersecting families (Q1763876) (← links)
• Weighted 3-wise 2-intersecting families (Q1865384) (← links)
• Shadows and intersections in vector spaces (Q1957963) (← links)
• On set systems without a simplex-cluster and the junta method (Q2010639) (← links)
• Old and new applications of Katona's circle (Q2033941) (← links)
• On the \(d\)-cluster generalization of Erdős-Ko-Rado (Q2037168) (← links)
• On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
• Structural results for conditionally intersecting families and some applications (Q2185223) (← links)
• Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
• New results on simplex-clusters in set systems (Q2236657) (← links)
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
• \(d\)-cluster-free sets with a given matching number (Q2323253) (← links)
• Erdős--Ko--Rado for three sets (Q2368657) (← links)
• Multiply-intersecting families revisited (Q2384803) (← links)
• Theorems of Erdős-Ko-Rado type in geometrical settings (Q2438531) (← links)
• The maximum size of 4-wise 2-intersecting and 4-wise 2-union families (Q2493102) (← links)
• The maximum size of 3-wise intersecting and 3-wise union families (Q2502036) (← links)
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
• High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
• The maximum measure of 3-wise \(t\)-intersecting families (Q2701004) (← links)
• Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
• On <i>r</i>-Cross Intersecting Families of Sets (Q3103624) (← links)
• Structure and stability of triangle-free set systems (Q3420310) (← links)
• An extension of the Erdős–Ko–Rado Theorem (Q3439573) (← links)
• Triangles in intersecting families (Q6074972) (← links)
• Non-trivial \(r\)-wise intersecting families (Q6155545) (← links)