Back to Search
Start Over
Tur\'an graphs with bounded matching number
- Publication Year :
- 2022
-
Abstract
- We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at most $s$ and clique number at most $k$ for all admissible values of the parameters.
Details
- Database :
- OAIster
- Publication Type :
- Electronic Resource
- Accession number :
- edsoai.on1381577208
- Document Type :
- Electronic Resource