Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Matchings in graphs of size \(\aleph_ 1\)

From MaRDI portal
Publication:1055786
Jump to:navigation, search

DOI10.1016/0095-8956(84)90017-0zbMath0522.05054OpenAlexW2023195474MaRDI QIDQ1055786

Ron Aharoni

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90017-0


zbMATH Keywords

perfect matchingstationary sets


Mathematics Subject Classification ID

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


Related Items (4)

Matchings in infinite graphs ⋮ Menger's theorem for infinite graphs ⋮ On an obstruction for perfect matchings ⋮ A generalization of Tutte's 1-factor theorem to countable graphs



Cites Work

  • On an obstruction for perfect matchings
  • Matchings in infinite graphs
  • Matchings in Countable Graphs


This page was built for publication: Matchings in graphs of size \(\aleph_ 1\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1055786&oldid=13069207"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki