Pages that link to "Item:Q4193465"
From MaRDI portal
The following pages link to Intersection Properties of Systems of Finite Sets (Q4193465):
Displaying 50 items.
- Improved bounds on the chromatic numbers of the square of Kneser graphs (Q393168) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Uniform eventown problems (Q499480) (← links)
- An intersection theorem for systems of finite sets (Q516775) (← links)
- On subsets with cardinalities of intersections divisible by a fixed integer (Q585202) (← links)
- Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems (Q627935) (← links)
- Bounds on three- and higher-distance sets (Q648975) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Families of finite sets with three intersections (Q761458) (← links)
- On finite set-systems whose every intersection is a kernel of a star (Q787982) (← links)
- Injection geometries (Q801926) (← links)
- Set systems with three intersections (Q1062054) (← links)
- Forbidding just one intersection (Q1062676) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- On squashed designs (Q1097892) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Intersection theorems in permutation groups (Q1113278) (← links)
- On set intersections (Q1138551) (← links)
- On Sperner families in which no k sets have an empty intersection. III (Q1167724) (← links)
- Intersection theorems with geometric consequences (Q1171072) (← links)
- Extension operations for cuts (Q1199597) (← links)
- Helly property in finite set systems (Q1208035) (← links)
- Intersection statements for systems of sets (Q1369684) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- Ranks of matrices with few distinct entries (Q1686308) (← links)
- Almost disjoint families of 3-term arithmetic progressions (Q1763874) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- An Erdős-Ko-Rado theorem for regular intersecting families of octads (Q1821104) (← links)
- Hypercube embedding of generalized bipartite metrics (Q1842652) (← links)
- The complete nontrivial-intersection theorem for systems of finite sets (Q1924241) (← links)
- Set systems with positive intersection sizes (Q2012516) (← links)
- Pseudo sunflowers (Q2143417) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- On triangles in derangement graphs (Q2229160) (← links)
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations (Q2236813) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- An \(L\)-system on the small Witt design (Q2368651) (← links)
- Intersecting systems of signed sets (Q2372885) (← links)
- Bounds on sets with few distances (Q2431616) (← links)
- A note on a conjecture by Füredi (Q2500627) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Around Borsuk's hypothesis (Q2519261) (← links)
- Coloring of the square of Kneser graph \(K(2k+r,k)\) (Q2631087) (← links)
- Intersecting families with sunflower shadows (Q2678397) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- On some combinatorial problems (Q3231171) (← links)
