Pages that link to "Item:Q3281090"
From MaRDI portal
The following pages link to INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS (Q3281090):
Displaying 50 items.
- Disjoint pairs in set systems with restricted intersection (Q2011127) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Set systems with positive intersection sizes (Q2012516) (← links)
- Erdős-Ko-Rado theorems on the weak Bruhat lattice (Q2026320) (← links)
- 3-setwise intersecting families of the symmetric group (Q2032892) (← links)
- Saturation problems in the Ramsey theory of graphs, posets and point sets (Q2033927) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Minimum degree and diversity in intersecting antichains (Q2036583) (← links)
- On the \(d\)-cluster generalization of Erdős-Ko-Rado (Q2037168) (← links)
- The toughness of Kneser graphs (Q2037560) (← links)
- The general position problem on Kneser graphs and on some graph operations (Q2042634) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- On \(L\)-close Sperner systems (Q2045374) (← 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 the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- Erdős-Ko-Rado theorem for matrices over residue class rings (Q2053711) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering (Q2056927) (← links)
- Bollobás-type theorems for hemi-bundled two families (Q2065121) (← links)
- Kruskal-Katona function and variants of cross-intersecting antichains (Q2065885) (← links)
- A short proof of Talbot's theorem for intersecting separated sets (Q2066007) (← links)
- On the chromatic number of two generalized Kneser graphs (Q2066011) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- On the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- Best possible bounds on the number of distinct differences in intersecting families (Q2080226) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- Vector-spread monomial ideals and Eliahou-Kervaire type resolutions (Q2099257) (← links)
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem (Q2107760) (← links)
- The EKR-module property of pseudo-Paley graphs of square order (Q2112567) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields (Q2120915) (← links)
- Modular and fractional \(L\)-intersecting families of vector spaces (Q2121787) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space (Q2121804) (← links)
- Stability on matchings in 3-uniform hypergraphs (Q2124791) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- On maximum intersecting sets in direct and wreath product of groups (Q2136206) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- Clique number of Xor products of Kneser graphs (Q2138983) (← links)
- On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups (Q2143623) (← links)
- Erdős-Ko-Rado sets of flags of finite sets (Q2154325) (← links)
- The maximum sum of sizes of cross-intersecting families of subsets of a set (Q2166267) (← links)
- Extremal \(t\)-intersecting families for direct products (Q2166286) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings (Q2169824) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
