Tight lower bounds on the size of a maximum matching in a regular graph
From MaRDI portal
Publication:2478167
DOI10.1007/s00373-007-0757-5zbMath1143.05065OpenAlexW2035633339MaRDI QIDQ2478167
Anders Yeo, Michael A. Henning
Publication date: 14 March 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0757-5
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (30)
A lower bound on the acyclic matching number of subcubic graphs ⋮ Matchings in graphs of odd regularity and girth ⋮ Matching and edge-connectivity in regular graphs ⋮ On vertex independence number of uniform hypergraphs ⋮ A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number ⋮ Matchings in graphs from the spectral radius ⋮ Independence and matching number of some graphs ⋮ Directed domination in oriented graphs ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Independent sets and matchings in subcubic graphs ⋮ Game matching number of graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Spectral radius and matchings in graphs ⋮ Lower bounds on the uniquely restricted matching number ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three ⋮ Largest 2-regular subgraphs in 3-regular graphs ⋮ On disjoint matchings in cubic graphs ⋮ Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree ⋮ A characterization of graphs with given maximum degree and smallest possible matching number ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ Domination in Digraphs ⋮ Unnamed Item ⋮ A characterization of graphs with given maximum degree and smallest possible matching number. II ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Bounds on maximum \(b\)-matchings ⋮ Total domination in partitioned graphs ⋮ Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs ⋮ A generalization of Petersen's matching theorem ⋮ On Lower Bounds for the Matching Number of Subcubic Graphs
Cites Work
This page was built for publication: Tight lower bounds on the size of a maximum matching in a regular graph
