Tur\'an graphs with bounded matching number
classification
🧮 math.CO
cs.DM
keywords
numbermatchingadmissibleboundedcliquedetermineedgesgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.