Fractional Gallai–Edmonds decomposition and maximal graphs on fractional matching number

Yan Liu (), Mengxia Lei and Xueli Su
Additional contact information
Yan Liu: South China Normal University
Mengxia Lei: South China Normal University
Xueli Su: South China Normal University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 1, No 5, 59-68

Abstract: 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$$∑e∈Γ(v)f(e)≤1, where $$\Gamma (v)$$Γ(v) is the set of all edges incident with v. The fractional matching number $$\mu _{f}(G)$$μf(G) of G is the supremum of $$\sum \nolimits _{e\in E(G)}f(e)$$∑e∈E(G)f(e) over all fractional matchings f of G. Let $$D_f(G)$$Df(G) be the set of vertices which are unsaturated by some maximum fractional matching of G, $$A_f(G)$$Af(G) the set of vertices in $$V(G)-D_f(G)$$V(G)-Df(G) adjacent to a vertex in $$D_f(G)$$Df(G) and $$C_f(G)=V(G)-A_f(G)-D_f(G)$$Cf(G)=V(G)-Af(G)-Df(G). In this paper, the partition $$(C_f(G), A_f(G), D_f(G))$$(Cf(G),Af(G),Df(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)$$μf(G) if any addition of edge increases the fractional matching number $$\mu _{f}(G)$$μ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.

Keywords: Fractional matching; Fractional Gallai–Edmonds decomposition; Maximal graphs; Turán number; Saturation number (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00566-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:40:y:2020:i:1:d:10.1007_s10878-020-00566-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00566-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().