On the intersection conjecture for infinite trees of matroids

DOI10.1016/j.jctb.2021.05.007OpenAlexW3172375624MaRDI QIDQ1984511

Johannes Carmesin, Nathan Bowler

Publication date: 16 September 2021

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

Full work available at URL: https://arxiv.org/abs/1404.6067

zbMATH Keywords

matroidinfinite combinatoricsMenger's theoreminfinite matroidsErdős-Menger propertymatroid itersection

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid intersection, base packing and base covering for infinite matroids
• Axioms for infinite matroids
• Matroids with an infinite circuit-cocircuit intersection
• Thin sums matroids and duality
• Dual trees must share their ends
• Infinite graphic matroids
• The pointwise view of determinacy: arboreal forcings, measurability, and weak measurability
• The structure of 2-separations of infinite matroids
• Menger's theorem for infinite graphs
• The axiom of determinacy and the modern development of descriptive set theory
• An excluded minors method for infinite matroids
• On the intersection of infinite matroids
• A General Setting for the Pointwise Investigation of Determinacy
• The Intersection of Two Infinite Matroids
• On the Lebesgue measurability and the axiom of determinateness

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