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.
- On the probability of a rational outcome for generalized social welfare functions on three alternatives (Q965219) (← links)
- Cross-intersecting families of permutations (Q965227) (← links)
- Multiple cross-intersecting families of signed sets (Q965233) (← links)
- Cross \(\mathcal L\)-intersecting families on set systems (Q965946) (← links)
- Algebraic shifting of strongly edge decomposable spheres (Q966065) (← links)
- Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Note on set systems without a strong simplex (Q968446) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations (Q1003591) (← links)
- Set systems with \(\mathcal L\)-intersections modulo a prime number (Q1003627) (← links)
- The covering radius of extreme binary 2-surjective codes (Q1008977) (← links)
- The unbalance of set systems (Q1014818) (← links)
- A generalization of Talbot's theorem about King Arthur and his knights of the round table (Q1024989) (← links)
- On \(t\)-intersecting families of signed sets and permutations (Q1025955) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- Commutative association schemes (Q1039424) (← links)
- The Erdős-Ko-Rado properties of various graphs containing singletons (Q1043643) (← links)
- Families intersecting on an interval (Q1043658) (← links)
- A short proof of a cross-intersection theorem of Hilton (Q1044944) (← links)
- The Erdős-Ko-Rado properties of set systems defined by double partitions (Q1044945) (← links)
- Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families (Q1045081) (← links)
- Fractional set systems with few disjoint pairs (Q1045152) (← links)
- A generalization of the Erdős-Ko-Rado theorem (Q1045161) (← links)
- On the density of sets of vectors (Q1050983) (← links)
- On qualitatively independent partitions and related problems (Q1051639) (← links)
- An extremal theorem on divisors of a number (Q1053044) (← links)
- An intersection-union theorem for integer sequences (Q1057272) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- Forbidding just one intersection (Q1062676) (← links)
- Intersection theorems for vector spaces (Q1065892) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
- Non-trivial intersecting families (Q1069937) (← links)
- Hamiltonian uniform subset graphs (Q1071032) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- A generalization of a theorem of Kruskal (Q1073037) (← links)
- Polytopes determined by hypergraph classes (Q1073043) (← links)
- The Erdős-Ko-Rado theorem for vector spaces (Q1086589) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- The maximum number of balancing sets (Q1092046) (← links)
- On the representing number of intersecting families (Q1093635) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- An Erdős-Ko-Rado theorem for integer sequences of given rank (Q1096631) (← links)
- On squashed designs (Q1097892) (← links)
- Families of finite sets with minimum shadows (Q1100465) (← links)
- Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms (Q1106215) (← links)
- Some intersection theorems on two-valued functions (Q1106236) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- Erdős-Ko-Rado theorem with conditions on the maximal degree (Q1112818) (← links)
