Generalized Turán problem with bounded matching number

DOI10.37236/13563MaRDI QIDQ6841446zbMATH OpenFDO

Authors Yue Ma, Xinmin Hou, Zhi Yin

Publication date 20 March 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13563

zbMATH Keywords

extremal graphTurán graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cites work

• Counting copies of a fixed subgraph in F-free graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Few \(H\) copies in \(F\)-saturated graphs
• Generalized Turán problems for double stars
• Generalized Turán problems for even cycles
• Generalized Turán problems for small graphs
• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Many \(T\) copies in \(H\)-free graphs
• Many H-copies in graphs with a forbidden tree
• Matching theory
• On maximal paths and circuits of graphs
• On Turán-good graphs
• Some exact results for generalized Turán problems
• Some exact results of the generalized Turán numbers for paths
• Some sharp results on the generalized Turán numbers
• Turán graphs with bounded matching number

Cited in

(1)

• The number of stars in a graph that forbids a matching and any graph

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

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