On the intersection conjecture for infinite trees of matroids
Combinatorics
2014-04-25 v1 Logic
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.
Cite
@article{arxiv.1404.6067,
title = {On the intersection conjecture for infinite trees of matroids},
author = {Nathan Bowler and Johannes Carmesin},
journal= {arXiv preprint arXiv:1404.6067},
year = {2014}
}