Pages that link to "Item:Q1671747"
From MaRDI portal
The following pages link to Diversity of uniform intersecting families (Q1671747):
Displaying 15 items.
- Maximum degree and diversity in intersecting hypergraphs (Q777477) (← links)
- Two extremal problems on intersecting families (Q1633597) (← links)
- Minimum degree and diversity in intersecting antichains (Q2036583) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree (Q5001841) (← links)
- Diversity (Q5918313) (← links)
- Sharp threshold for the Erdős–Ko–Rado theorem (Q6077048) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
- Uniform intersecting families with large covering number (Q6170804) (← links)
- Improved bounds on the maximum diversity of intersecting families (Q6201878) (← links)
