Sharp lower bounds on the fractional matching number

DOI10.1016/j.dam.2015.01.014zbMath1311.05158OpenAlexW2001072455MaRDI QIDQ2345617

Roger E. Behrend, Douglas B. West, Suil O

Publication date: 22 May 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.014

zbMATH Keywords

fractional matchingbiregular bipartite graphTutte's condition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Integer \(k\)-matchings of graphs ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ Fractional matching number and eigenvalues of a graph ⋮ Signless Laplacian spectral radius and fractional matchings in graphs

Cites Work

• Unnamed Item
• Minimum node covers and 2-bicritical graphs
• The Factorization of Linear Graphs