On the intersection conjecture for infinite trees of matroids

DOI10.1016/J.JCTB.2021.05.007MaRDI QIDQ6250979arXivFDO

Authors Nathan Bowler, Johannes Carmesin

Publication date 24 April 2014

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JCTB.2021.05.007

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

arXiv classification

math.COmath.LO

Abstract: Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

This page was built for publication: On the intersection conjecture for infinite trees of matroids

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