The following pages link to (Q3424782):
Displaying 21 items.
- Non-trivial intersecting uniform sub-families of hereditary families (Q383693) (← links)
- An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
- Erdös-Ko-Rado theorem for ladder graphs (Q477467) (← links)
- De Bruijn-Erdős-type theorems for graphs and posets (Q512579) (← links)
- Strongly intersecting integer partitions (Q740661) (← links)
- A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs (Q1024280) (← links)
- A generalization of Talbot's theorem about King Arthur and his knights of the round table (Q1024989) (← links)
- The Erdős-Ko-Rado properties of various graphs containing singletons (Q1043643) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
- Barak-Erdős graphs and the infinite-bin model (Q2077352) (← links)
- The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem (Q2107760) (← links)
- Generalised Mycielski graphs and the Borsuk-Ulam theorem (Q2327221) (← links)
- A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
- Erdős-Ko-Rado theorems for simplicial complexes (Q2431599) (← links)
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs (Q2448961) (← links)
- On the strength of König's duality theorem for countable bipartite graphs (Q4292597) (← links)
- (Q4779745) (← links)
