A Cantor-Bernstein theorem for infinite matroids
Combinatorics
2022-05-10 v4
Abstract
We give a common matroidal generalisation of `A Cantor-Bernstein theorem for paths in graphs' by Diestel and Thomassen and `A Cantor-Bernstein-type theorem for spanning trees in infinite graphs' by ourselves.
Cite
@article{arxiv.2009.08439,
title = {A Cantor-Bernstein theorem for infinite matroids},
author = {Attila Joó},
journal= {arXiv preprint arXiv:2009.08439},
year = {2022}
}