Maximum matchings in regular graphs of high girth

zbMath1111.05080MaRDI QIDQ870087

Abraham D. Flaxman, Shlomo Hoory

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127271

Mathematics Subject Classification ID

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

Related Items (11)

Local boxicity ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ Matchings in regular graphs: minimizing the partition function ⋮ Flipping triangles and rectangles ⋮ Matchings in graphs of odd regularity and girth ⋮ Uniquely restricted matchings in subcubic graphs without short cycles ⋮ Minimum k‐cores and the k‐core polytope ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Lower bounds on the uniquely restricted matching number ⋮ On disjoint matchings in cubic graphs ⋮ The matching process and independent process in random regular graphs and hypergraphs

This page was built for publication: Maximum matchings in regular graphs of high girth