Turán graphs with bounded matching number

Noga Alon; Péter Frankl

doi:10.1016/j.jctb.2023.12.002

Turán graphs with bounded matching number

Noga Alon, Péter Frankl

Mathematics

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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.

Original language	English (US)
Pages (from-to)	223-229
Number of pages	7
Journal	Journal of Combinatorial Theory. Series B
Volume	165
DOIs	https://doi.org/10.1016/j.jctb.2023.12.002
State	Published - Mar 2024

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Keywords

Clique number
Matching number
Turan graphs

Access to Document

10.1016/j.jctb.2023.12.002

Cite this

@article{2fdd2c0028b5447abaf69b75a30ccbda,

title = "Tur{\'a}n graphs with bounded matching number",

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.",

keywords = "Clique number, Matching number, Turan graphs",

author = "Noga Alon and P{\'e}ter Frankl",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier Inc.",

year = "2024",

month = mar,

doi = "10.1016/j.jctb.2023.12.002",

language = "English (US)",

volume = "165",

pages = "223--229",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Turán graphs with bounded matching number

AU - Alon, Noga

AU - Frankl, Péter

PY - 2024/3

Y1 - 2024/3

N2 - 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.

AB - 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.

KW - Clique number

KW - Matching number

KW - Turan graphs

UR - https://www.scopus.com/pages/publications/85180091180

UR - https://www.scopus.com/inward/citedby.url?scp=85180091180&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2023.12.002

DO - 10.1016/j.jctb.2023.12.002

M3 - Article

AN - SCOPUS:85180091180

SN - 0095-8956

VL - 165

SP - 223

EP - 229

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

ER -

Turán graphs with bounded matching number

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this