Abstract
A fractional matching of a graph G is a function f that assigns to each edge a number in [0, 1] such that for each vertex v, \(\sum \nolimits _{e\in \Gamma (v)}f(e) \le 1\), where \(\Gamma (v)\) is the set of all edges incident with v. The fractional matching number \(\mu _{f}(G)\) of G is the supremum of \(\sum \nolimits _{e\in E(G)}f(e)\) over all fractional matchings f of G. Let \(D_f(G)\) be the set of vertices which are unsaturated by some maximum fractional matching of G, \(A_f(G)\) the set of vertices in \(V(G)-D_f(G)\) adjacent to a vertex in \(D_f(G)\) and \(C_f(G)=V(G)-A_f(G)-D_f(G)\). In this paper, the partition \((C_f(G), A_f(G), D_f(G))\), named fractional Gallai–Edmonds decomposition, is obtained by an algorithm in polynomial time via the Gallai–Edmonds decomposition. A graph G is maximal on \(\mu _{f}(G)\) if any addition of edge increases the fractional matching number \(\mu _{f}(G)\). The Turán number is the maximum of edge numbers of maximal graphs and the saturation number is the minimum of edge numbers of maximal graphs. In this paper, the maximal graphs are characterized by using the fractional Gallai–Edmonds decomposition. Thus the Turán number, saturation number and extremal graphs are obtained.



Similar content being viewed by others
References
Kászonyi L, Tuza Z (2010) Saturated graphs with minimal number of edges. J. Graph Theory 10(2):203–210
Liu Y, Liu GZ (2002) The fractional matching numbers of graphs. Networks 40(4):228–231
Liu Y, Liu WW (2017) Fractional matching preclusion of graphs. J. Comb. Optim. 34(2):522–533
Liu Y, Liu XH (2018) Integer k-matchings of graphs. Discrete Appl. Math. 235:118–128
Lovász L, Plummer MD (1985) Matching Theory. Elsevier Science B. V., North Holland
Mader W (1973) 1-Faktoren von graphen. Math. Ann. 201(4):269–282
Pulleyblank WR (1987) Fractional matchings and the Edmonds–Gallai theorem. Discrete Appl. Math. 16(1):51–58
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is supported by the Scientific research fund of the Science and Technology Program “Research on the generalized matching theory and application of statistical model” of Guangzhou, China (authorized in 2020) and by the Qinghai Province Natural Science Foundation(No.2020-ZJ-924).
Rights and permissions
About this article
Cite this article
Liu, Y., Lei, M. & Su, X. Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number. J Comb Optim 40, 59–68 (2020). https://doi.org/10.1007/s10878-020-00566-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00566-4