The following pages link to (Q3770569):
Displayed 50 items.
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- Random walks and multiply intersecting families (Q1763876) (← links)
- The influence of variables in product spaces (Q1802329) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)
- Weighted 3-wise 2-intersecting families (Q1865384) (← links)
- Union of shadows (Q1885044) (← links)
- Cross-intersecting families of finite sets (Q1903016) (← links)
- Zero-sum problems -- a survey (Q1917486) (← links)
- On the \(c\)-strong chromatic number of \(t\)-intersecting hypergraphs (Q1945950) (← links)
- On cross \(t\)-intersecting families of sets (Q1957972) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← 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)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- On strengthenings of the intersecting shadow theorem (Q2049446) (← links)
- A short proof of Talbot's theorem for intersecting separated sets (Q2066007) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem (Q2107760) (← links)
- A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian (Q2141214) (← links)
- Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs (Q2161206) (← links)
- The maximum sum of sizes of cross-intersecting families of subsets of a set (Q2166267) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- An improved universal bound for \(t\)-intersecting families (Q2178676) (← links)
- Erdős-Ko-Rado theorem for a restricted universe (Q2185207) (← links)
- Cross-intersecting subfamilies of levels of hereditary families (Q2185903) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- A structure theorem for almost low-degree functions on the slice (Q2218715) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- On the structure of minimal winning coalitions in simple voting games (Q2268893) (← links)
- Classification of maximum hittings by large families (Q2303424) (← links)
- A Kruskal-Katona type result and applications (Q2305915) (← links)
- Families of finite sets satisfying intersection restrictions (Q2309551) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- VC dimension and a union theorem for set systems (Q2315444) (← links)
- AK-type stability theorems on cross \(t\)-intersecting families (Q2323248) (← links)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets (Q2346594) (← links)
- The maximum product of sizes of cross-intersecting families (Q2359973) (← links)
- A bipartite Erdős-Ko-Rado theorem (Q2366030) (← links)
- Intersecting \(k\)-uniform families containing a given family (Q2374169) (← links)
- Some exact results for multiply intersecting families (Q2421557) (← links)
- Turán, involution and shifting (Q2421565) (← links)
- Cross-intersecting non-empty uniform subfamilies of hereditary families (Q2422225) (← links)
- Triangle-intersecting families of graphs (Q2428720) (← links)
- Erdős-Ko-Rado theorems for simplicial complexes (Q2431599) (← links)