Maximum matchings in regular graphs of high girth

MaRDI QIDQ870087zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1n1.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• Maximum matchings in regular graphs
• Maximum matching in regular and almost regular graphs
• On maximum matchings in almost regular graphs
• Maximum matchings in a regular graph of specified connectivity and bounded order
• On maximal matchings of connected graphs
• Matchings in graphs of odd regularity and girth
• Tight lower bounds on the size of a maximum matching in a regular graph
• A note on a conjecture on maximum matching in almost regular graphs
• Maximum matchings in a class of random graphs
• scientific article; zbMATH DE number 2114098

Cited in

(21)

• A lower bound on the acyclic matching number of subcubic graphs
• Local boxicity
• On maximum matchings in König-Egerváry graphs
• Maximal matchings in graphs with large neighborhoods of independent vertices
• On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
• A note on a conjecture on maximum matching in almost regular graphs
• Lower bounds on the uniquely restricted matching number
• Matchings in graphs of odd regularity and girth
• Maximum matchings in regular graphs
• On the Size of Matchings in 1-Planar Graph with High Minimum Degree
• Matchings in regular graphs: minimizing the partition function
• Graphs, disjoint matchings and some inequalities
• The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
• Uniquely restricted matchings in subcubic graphs without short cycles
• Flipping triangles and rectangles
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• On maximum matchings in almost regular graphs
• On disjoint matchings in cubic graphs
• Minimum k‐cores and the k‐core polytope
• On maximum matchings in 5-regular and 6-regular multigraphs
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870087)