Matchings in Countable Graphs

DOI10.4153/CJM-1977-016-8MaRDI QIDQ4087227zbMATH OpenFDO

Authors

Publication date 1977

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1977-016-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(9)

• Matchings in graphs of size \(\aleph_ 1\)
• Matchings in infinite graphs
• Infinite matching theory
• \(f\)-optimal factors of infinite graphs
• The computational strength of matchings in countable graphs
• The Lovász-Cherkassky theorem in infinite graphs
• Zorn's lemma, reverse mathematics, and applications in combinatorics
• A generalization of Tutte's 1-factor theorem to countable graphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Matchings in Countable Graphs

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