A note on maximum size of a graph without isolated vertices under the given matching number

DOI10.1016/J.AMC.2023.128295OpenAlexW4386208127MaRDI QIDQ6095058

Tianlong Ma, Chao Shi

Publication date: 11 October 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2023.128295

zbMATH Keywords

matchingTurán problemfractional matchingmaximum number of edges

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected graphs without long paths
• Maximum size of a graph with given fractional matching number
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• A note on Turán's theorem
• On maximal paths and circuits of graphs
• Turán's theorem and k‐connected graphs

This page was built for publication: A note on maximum size of a graph without isolated vertices under the given matching number