Pages that link to "Item:Q1066141"
From MaRDI portal
The following pages link to An extremal problem for sets with applications to graph theory (Q1066141):
Displayed 9 items.
- Solution of an extremal problem for sets using resultants of polynomials (Q809102) (← links)
- A simple proof of the upper bound theorem (Q1068364) (← links)
- Hyperconnectivity of graphs (Q1086586) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- On the kernel of intersecting families (Q1106213) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Asymptotic growth of sparse saturated structures is locally determined (Q1201274) (← links)
- An extremal problem for sets: A new approach via Bezoutians (Q1208052) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)