The difference and ratio of the fractional matching number and the matching number of graphs
From MaRDI portal
Publication:906487
DOI10.1016/j.disc.2015.12.005zbMath1329.05242arXiv1512.07595OpenAlexW2216111877MaRDI QIDQ906487
Suil O, Ilkyoo Choi, Jae-Hoon Kim
Publication date: 21 January 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07595
Related Items (8)
The skiving stock problem and its relation to hypergraph matchings ⋮ Integer \(k\)-matchings of graphs ⋮ Spectral radius and fractional perfect matchings in graphs ⋮ Combinatorics of unavoidable complexes ⋮ A Ramsey-type theorem for the matching number regarding connected graphs ⋮ Fractional matching number and eigenvalues of a graph ⋮ Nordhaus-Gaddum type inequality for the fractional matching number of a graph ⋮ Signless Laplacian spectral radius and fractional matchings in graphs
Cites Work
This page was built for publication: The difference and ratio of the fractional matching number and the matching number of graphs
