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.
- Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number (Q2441664) (← links)
- The Erdős-Ko-Rado theorem for singular linear spaces (Q2442229) (← links)
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs (Q2448961) (← links)
- Forbidding a set difference of size 1 (Q2449075) (← links)
- Forbidding just one intersection, for permutations (Q2452427) (← links)
- Threshold graphs, shifted complexes, and graphical complexes (Q2455583) (← links)
- New results related to a conjecture of Manickam and Singhi (Q2472830) (← links)
- A new short proof of a theorem of Ahlswede and Khachatrian (Q2474500) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- The maximum size of 4-wise 2-intersecting and 4-wise 2-union families (Q2493102) (← links)
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs (Q2497975) (← links)
- Extremal problems among subsets of a set. (Reprint) (Q2497992) (← links)
- The maximum size of 3-wise intersecting and 3-wise union families (Q2502036) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- The maximum sum and the maximum product of sizes of cross-intersecting families (Q2509742) (← links)
- A note on the Manickam-Miklós-Singhi conjecture (Q2509743) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Around Borsuk's hypothesis (Q2519261) (← links)
- Maximum stable sets in analogs of Kneser and complete graphs (Q2519792) (← links)
- An extremal problem on the set of noncoprime divisors of a number (Q2546346) (← links)
- A simple proof of the Erdős-Chao Ko-Rado theorem (Q2560819) (← links)
- Two applications (for search theory and truth functions) of Sperner type theorems (Q2562082) (← links)
- Families of \(k\)-independent sets (Q2563162) (← links)
- A generalization of the Erdős-Ko-Rado theorem on finite set systems (Q2563163) (← links)
- A Katona-type proof of an Erdős-Ko-Rado-type theorem (Q2566804) (← links)
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- Fractional cross intersecting families (Q2657100) (← links)
- Analogues of Katona's and Milner's theorems for two families (Q2659239) (← links)
- Almost intersecting families (Q2662348) (← links)
- Remarks on the Erdős matching conjecture for vector spaces (Q2662794) (← links)
- Non-trivial \(t\)-intersecting families for symplectic polar spaces (Q2667094) (← links)
- The spectral radii of intersecting uniform hypergraphs (Q2667351) (← links)
- Combinatorics of antiprism triangulations (Q2671169) (← links)
- Approximation by juntas in the symmetric group, and forbidden intersection problems (Q2671454) (← links)
- The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex (Q2671549) (← links)
- Maximal independent sets in clique-free graphs (Q2674559) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- Intersecting families with sunflower shadows (Q2678397) (← links)
- Hilton-Milner results in projective and affine spaces (Q2684904) (← links)
- On the intersection density of the symmetric group acting on uniform subsets of small size (Q2689147) (← links)
- Perfect matchings in down-sets (Q2689497) (← links)
- On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
- Non-trivial 3-wise intersecting uniform families (Q2689515) (← links)
- Characterizing maximal shifted intersecting set systems and short injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems (Q2694281) (← links)
- Constructions of binary codes with two distances (Q2699909) (← links)
- Erdős-Ko-Rado and Hilton-Milner theorems for two-forms (Q2699931) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- Intersections and distinct intersections in cross-intersecting families (Q2700975) (← links)
