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

Chao Shi and Tianlong Ma

Applied Mathematics and Computation, 2024, vol. 460, issue C

Abstract: In this paper, we determine the maximum size of a graph of fixed order without isolated vertices which contains (fractional) matching of given size, which is a variation of some known results involving the maximum size of all graphs of fixed order containing matching of given size by Erdős and Gallai. As corollaries of our results, Turán-type results for a connected graph on (fractional) matching are obtained.

Keywords: Maximum number of edges; Turán problem; Matching; Fractional matching (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323004642
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:460:y:2024:i:c:s0096300323004642

DOI: 10.1016/j.amc.2023.128295

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().