On Turán problems with bounded matching number

DOI10.1002/JGT.23067MaRDI QIDQ6201023zbMATH OpenFDO

Authors Dániel Gerbner

Publication date 25 March 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

matchingTurán number

Mathematics Subject Classification ID

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

Abstract: Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-free graphs with matching number at most $s$. For fixed $F$ and $s$, we determine this number apart from a constant additive term. We also obtain several exact results.

Recommendations

• Turán graphs with bounded matching number
• On the maximum number of edges in hypergraphs with fixed matching and clique number
• On the maximum number of edges in a hypergraph with given matching number
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Degrees and matchings
• Intersection theorems for systems of sets
• On maximal paths and circuits of graphs

Cited in

(2)

• Turán graphs with bounded matching number
• A note on maximum size of a graph without isolated vertices under the given matching number

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

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