The exact Turán number of K₄^3 - with small bounded matching number

DOI10.1016/J.DAM.2026.08.011MaRDI QIDQ7353753zbMATH OpenFDO

Authors Yuzhen Qi, Chunrui Ding

Publication date 18 September 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.08.011

Mathematics Subject Classification ID

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

Cites work

• Daisies and other Turán problems
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• On hypergraph Turán problems with bounded matching number
• On maximal paths and circuits of graphs
• On Turán problems with bounded matching number
• Turán graphs with bounded matching number

This page was built for publication: The exact Turán number of \(K_4^{3 -}\) with small bounded matching number

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