Perfect matching preservers

MaRDI QIDQ870013zbMATH OpenFDO

Authors Richard A. Brualdi, Martin Loebl, Ondřej Pangrác

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/127627, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r95.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

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: For two bipartite graphs \(G\) and \(G'\), a bijection \(\psi: E(G)\rightarrow E(G')\) is called a (perfect) matching preserver provided that \(M\) is a perfect matching in \(G\) if and only if \(\psi(M)\) is a perfect matching in \(G'\). We characterize bipartite graphs \(G\) and \(G'\) which are related by a matching preserver and the matching preservers between them.

Recommendations

• scientific article; zbMATH DE number 1161279
• On the uniqueness of perfect matchings in bipartite graphs
• Perfect matchings and derangements on graphs
• scientific article; zbMATH DE number 6000779
• scientific article; zbMATH DE number 3987

Cited in

(1)

• Preservation of complete Baireness

This page was built for publication: Perfect matching preservers

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