English

Tur\'an graphs with bounded matching number

Combinatorics 2022-10-28 v1 Discrete Mathematics

Abstract

We determine the maximum possible number of edges of a graph with nn vertices, matching number at most ss and clique number at most kk for all admissible values of the parameters.

Keywords

Cite

@article{arxiv.2210.15076,
  title  = {Tur\'an graphs with bounded matching number},
  author = {Noga Alon and Peter Frankl},
  journal= {arXiv preprint arXiv:2210.15076},
  year   = {2022}
}
R2 v1 2026-06-28T04:36:26.287Z