On Turán problems with bounded matching number

DOI10.1002/jgt.23067arXiv2211.03272MaRDI QIDQ6201023

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)

Cites Work

• Degrees and matchings
• Intersection theorems for systems of sets
• On maximal paths and circuits of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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