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.
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- On intersecting families of independent sets in trees (Q2172383) (← links)
- Intersection theorems for triangles (Q2172651) (← links)
- An improved universal bound for \(t\)-intersecting families (Q2178676) (← links)
- Erdős-Ko-Rado theorem for a restricted universe (Q2185207) (← links)
- Structural results for conditionally intersecting families and some applications (Q2185223) (← links)
- Cross-intersecting subfamilies of levels of hereditary families (Q2185903) (← links)
- On semi-transitive orientability of Kneser graphs and their complements (Q2185911) (← links)
- The formula for Turán number of spanning linear forests (Q2185927) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On the Duffin-Schaeffer conjecture (Q2193965) (← links)
- Graphical designs and extremal combinatorics (Q2197221) (← links)
- Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- On the number of distinct differences in an intersecting family (Q2214062) (← links)
- Restricted intersecting families on simplicial complex (Q2221794) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- Hedetniemi's conjecture is asymptotically false (Q2221935) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- Analogues of Milner's theorem for families without long chains and of vector spaces (Q2225460) (← links)
- On triangles in derangement graphs (Q2229160) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- Neighborhood complexes and Kronecker double coverings (Q2231247) (← links)
- The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings (Q2232305) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- New results on simplex-clusters in set systems (Q2236657) (← 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)
- Game saturation of intersecting families (Q2248514) (← links)
- The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces (Q2249647) (← links)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- Intersecting families of discrete structures are typically trivial (Q2258906) (← links)
- An Erdős-Ko-Rado theorem for restricted signed sets (Q2267280) (← links)
- On the Hadwiger number of Kneser graphs and their random subgraphs (Q2278635) (← links)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
- Mixed matchings in graphs (Q2279983) (← links)
- Erdős-Ko-Rado theorems for set partitions with certain block size (Q2299629) (← links)
- Vertex-isoperimetric stability in the hypercube (Q2299635) (← links)
- The EKR property for flag pure simplicial complexes without boundary (Q2299647) (← links)
- Classification of maximum hittings by large families (Q2303424) (← 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)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- Cameron-Liebler sets of generators in finite classical polar spaces (Q2318487) (← links)
- Short proof of two cases of Chvátal's conjecture (Q2319699) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
