The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number

DOI10.1016/J.DISC.2023.113734zbMath1525.05157OpenAlexW4387773995MaRDI QIDQ6080217

Leilei Zhang, Yuxuan Liu

Publication date: 30 October 2023

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

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113734

zbMATH Keywords

matching numbercircumferencecomplete multipartite graphgeneralized Turán number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Cycles in 2-connected graphs
• On the maximum number of five-cycles in a triangle-free graph
• Stability results on the circumference of a graph
• Connected graphs without long paths
• A method in graph theory
• Some simplified NP-complete graph problems
• The maximum number of cliques in graphs without long cycles
• Maximizing the number of cliques in graphs with given matching number
• The generalized Turán number of spanning linear forests
• Generalized Turán problems for even cycles
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• A Generalized Turán Problem and its Applications
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number