Pages that link to "Item:Q1924241"

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

Displaying 50 items.

• Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
• Intersection problems in the \(q\)-ary cube (Q272323) (← links)
• On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
• Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932) (← links)
• New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← 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)
• On the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
• Stability for \(t\)-intersecting families of permutations (Q616451) (← links)
• Invitation to intersection problems for finite sets (Q739389) (← links)
• Optimal tristance anticodes in certain graphs (Q817597) (← links)
• Intersection theorems for multisets (Q896069) (← links)
• A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← 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)
• The diametric theorem in Hamming spaces---optimal anticodes (Q1271885) (← links)
• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration (Q1296753) (← links)
• Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
• Colourings without monochromatic disjoint pairs (Q1746571) (← links)
• The structure of large non-trivial \(t\)-intersecting families of finite sets (Q2048354) (← links)
• Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
• On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
• On Ramsey numbers for arbitrary sequences of graphs (Q2145747) (← links)
• On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
• Intersecting families of discrete structures are typically trivial (Q2258906) (← links)
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections (Q2262987) (← links)
• Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
• Using the existence of \(t\)-designs to prove Erdős-Ko-Rado (Q2317656) (← links)
• New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
• The weighted complete intersection theorem (Q2363359) (← links)
• On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
• Intersection theorems under dimension constraints (Q2368655) (← links)
• Multiply-intersecting families revisited (Q2384803) (← links)
• Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
• On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861) (← links)
• Brace-Daykin type inequalities for intersecting families (Q2462339) (← links)
• A new short proof of a theorem of Ahlswede and Khachatrian (Q2474500) (← links)
• Around Borsuk's hypothesis (Q2519261) (← links)
• Non-trivial \(t\)-intersecting families for symplectic polar spaces (Q2667094) (← links)
• Non-trivial 3-wise intersecting uniform families (Q2689515) (← links)
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family (Q2832808) (← links)
• On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families (Q3191212) (← links)
• Size of Downsets in the Pushing Order and a Problem of Berlekamp (Q3439292) (← links)
• An extension of the Erdős–Ko–Rado Theorem (Q3439573) (← links)
• On Mubayi's Conjecture and Conditionally Intersecting Sets (Q4684465) (← links)
• Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers (Q4796016) (← links)
• Nontrivial <i>t</i>-Intersecting Families for Vector Spaces (Q5096589) (← links)
• Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)