Tight lower bounds on the matching number in a graph with given maximum degree

DOI10.1002/JGT.22244zbMath1401.05235arXiv1604.05020OpenAlexW2963232981MaRDI QIDQ4553732

Michael A. Henning, Anders Yeo

Publication date: 31 October 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05020

zbMATH Keywords

convex setmatching numbermaximum degree

Mathematics Subject Classification ID

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

Related Items (13)

Transversals and independence in linear hypergraphs with maximum degree two ⋮ Uniquely restricted matchings in subcubic graphs ⋮ A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number ⋮ Uniquely restricted matchings in subcubic graphs without short cycles ⋮ Building large \(k\)-cores from sparse graphs ⋮ Lower bounds on the uniquely restricted matching number ⋮ Unnamed Item ⋮ A characterization of graphs with given maximum degree and smallest possible matching number ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ 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 ⋮ A generalization of Petersen's matching theorem

This page was built for publication: Tight lower bounds on the matching number in a graph with given maximum degree