A note on a conjecture on maximum matching in almost regular graphs

DOI10.1016/J.DISC.2010.09.003MaRDI QIDQ607026zbMATH OpenOpenAlexWikidataFDO

Authors Christophe Picouleau

Publication date 19 November 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.09.003

zbMATH Keywords

bipartite graphmatchingregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On maximum matchings in almost regular graphs
• Maximum matchings in regular graphs
• On maximum matchings in 5-regular and 6-regular multigraphs
• Maximum matchings in regular graphs of high girth
• scientific article; zbMATH DE number 5053297

Cites work

• On disjoint matchings in cubic graphs

Cited in

(8)

• Maximum matchings in regular graphs
• A counterexample to Aharoni's strongly maximal matching conjecture
• On maximum matchings in 5-regular and 6-regular multigraphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• Corrigendum to: ``On disjoint matchings in cubic graphs
• On maximum matchings in almost regular graphs
• Counterexamples to a conjecture on matching Kneser graphs
• Maximum matchings in regular graphs of high girth

This page was built for publication: A note on a conjecture on maximum matching in almost regular graphs

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