Pages that link to "Item:Q1621069"
From MaRDI portal
The following pages link to Families of sets with no matchings of sizes 3 and 4 (Q1621069):
Displaying 13 items.
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- Refuting conjectures in extremal combinatorics via linear programming (Q2010628) (← links)
- Extremal set theory for the binomial norm (Q2010646) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- Modularity of some distance graphs (Q2243703) (← links)
- New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← 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)
- On families with bounded matching number (Q6079296) (← links)
