On Lower Bounds for the Matching Number of Subcubic Graphs
From MaRDI portal
Abstract: We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic graph G, where n_i denotes the number of vertices of degree i for each i.
Recommendations
- A lower bound on the acyclic matching number of subcubic graphs
- A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number
- A new lower bound on the number of perfect matchings in cubic graphs
- The lower bound on the number of maximum matchings of a graph
- New lower bounds for matching numbers of general and bipartite graphs
- Induced matchings in subcubic graphs
- On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
- Uniquely restricted matchings in subcubic graphs
- Tight lower bounds on the matching number in a graph with given maximum degree
- Lower bounds of graph energy in terms of matching number
Cites work
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Independent sets and matchings in subcubic graphs
- polymake: a framework for analyzing convex polytopes
- Small transversals in hypergraphs
- Tight bounds on maximal and maximum matchings
- Tight lower bounds on the size of a maximum matching in a regular graph
Cited in
(14)- A lower bound on the acyclic matching number of subcubic graphs
- Sharp lower bound for the total number of matchings of tricyclic graphs
- 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
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- scientific article; zbMATH DE number 5722256 (Why is no real title available?)
- Bounds on some parameters in triangle-free cubic 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
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree
- The 1-nearly edge independence number of a graph
This page was built for publication: On Lower Bounds for the Matching Number of Subcubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272918)
