Author:
Bowler Nathan,Carmesin Johannes
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. R. Aharoni and E. Berger: Menger’s theorem for infinite graphs, Invent. math. 176 (2009), 1–62.
2. R. Aharoni and C. Thomassen: Infinite, highly connected digraphs with no two arc-disjoint spanning trees, J. Graph Theory 13 (1989), 71–74.
3. R. Aharoni and R. Ziv: The intersection of two infinite matroids, J. London Math. Soc. 58 (1998), 513–525.
4. E. Aigner-Horev, J. Carmesin and J. Fröhlich: Infinite matroid union, preprint 2012, available at http://arxiv.org/pdf/1111.0602v2.
5. E. Aigner-Horev, J. Carmesin and J. Fröhlich: On the intersection of infinite matroids, preprint 2012, available at http://arxiv.org/pdf/1111.0606v2.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献