Turán graphs with bounded matching number

DOI10.1016/J.JCTB.2023.12.002zbMATH Open1530.05086arXiv2210.15076MaRDI QIDQ6187350FDOQ6187350

Authors: Noga Alon, Peter Frankl 

Publication date: 15 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2210.15076

Recommendations

• On Turán problems with bounded matching number
• On the maximum number of edges in hypergraphs with fixed matching and clique number
• Maximizing the number of cliques in graphs with given matching number
• On the maximum number of edges in a hypergraph with given matching number
• Graphs with restricted valency and matching number

zbMATH Keywords

clique numbermatching numberTuran graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching theory
• On maximal paths and circuits of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection theorems for systems of sets
• Title not available (Why is that?)

Cited In (2)

• A note on the stability results of the number of cliques in graphs with given matching number
• On Turán problems with bounded matching number

This page was built for publication: Turán graphs with bounded matching number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187350)