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.
- Union-intersecting set systems (Q497346) (← links)
- A note on supersaturated set systems (Q499460) (← links)
- Intersecting faces of a simplicial complex via algebraic shifting (Q501030) (← links)
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms (Q501273) (← links)
- A sharp bound for the product of weights of cross-intersecting families (Q504984) (← links)
- On the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
- Cross-intersecting pairs of hypergraphs (Q507820) (← links)
- Constructions and nonexistence results for suitable sets of permutations (Q507826) (← links)
- On the multicolor Ramsey number for 3-paths of length three (Q510341) (← links)
- Erdős-Ko-Rado theorems of labeled sets (Q511080) (← links)
- On random subgraphs of Kneser graphs and their generalizations (Q512505) (← links)
- Stars on trees (Q512591) (← links)
- An intersection theorem for systems of finite sets (Q516775) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- Around the complete intersection theorem (Q516788) (← links)
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families (Q516792) (← links)
- Set families with a forbidden pattern (Q518191) (← links)
- A size-sensitive inequality for cross-intersecting families (Q518199) (← links)
- A quasi-stability result for dictatorships in \(S_n\) (Q519995) (← links)
- One more Turán number and Ramsey number for the loose 3-uniform path of length three (Q521762) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- A product version of the Erdős-Ko-Rado theorem (Q533340) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- Intersecting antichains and shadows in linear lattices (Q549257) (← links)
- Cross-intersecting families and primitivity of symmetric systems (Q618301) (← links)
- An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line (Q618308) (← links)
- The Lex-Plus-Powers conjecture holds for pure powers (Q626119) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Set systems without a 3-simplex (Q641176) (← links)
- An improved bound for the Manickam-Miklós-Singhi conjecture (Q649004) (← links)
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- Forbiddance and capacity (Q659716) (← links)
- Maximum hitting of a set by compressed intersecting families (Q659747) (← links)
- Random Kneser graphs and hypergraphs (Q668022) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\) (Q670196) (← links)
- On topological relaxations of chromatic conjectures (Q710730) (← links)
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\) (Q722306) (← links)
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (Q729778) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances (Q739060) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Strongly intersecting integer partitions (Q740661) (← links)
- Maximum hitting for \(n\) sufficiently large (Q742567) (← links)
- An ordered version of the Erdős-Ko-Rado theorem (Q754201) (← links)
- The exact bound in the Erdős-Ko-Rado theorem (Q761464) (← links)
