Proof of Nash-Williams' intersection conjecture for countable matroids

DOI10.1016/J.AIM.2021.107608zbMATH Open1458.05038arXiv1912.13253OpenAlexW3126121509WikidataQ113881038 ScholiaQ113881038MaRDI QIDQ2227294FDOQ2227294

Authors: Attila Joó 

Publication date: 15 February 2021

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: We prove that if $M$ and $N$ are finitary matroids on a common countable edge set $E$ then they admit a common independent set $I$ such that there is a bipartition $E=E_{M}cup{E}_N$ for which $Icap{E}_M$ spans $E_M$ in $M$ and $Icap{E}_N$ spans $E_N$ in $N$. It answers positively the Matroid Intersection Conjecture of Nash-Williams in the countable case.

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

Recommendations

• Intersection of a partitional and a general infinite matroid
• The Intersection of Two Infinite Matroids
• scientific article; zbMATH DE number 3841889
• On the intersection of infinite matroids
• On the intersection conjecture for infinite trees of matroids

zbMATH Keywords

matroid intersectioninfinite matroidwaveaugmenthing path

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Infinite graphs (05C63) Other combinatorial set theory (03E05)

Cites Work

• Axioms for infinite matroids
• Menger's theorem for infinite graphs
• Matroid intersection, base packing and base covering for infinite matroids
• The Intersection of Two Infinite Matroids
• Matroids and duality
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the intersection of infinite matroids
• Title not available (Why is that?)

Cited In (9)

• On the packing/covering conjecture of infinite matroids
• A Cantor-Bernstein theorem for infinite matroids
• The Lovász-Cherkassky theorem in infinite graphs
• Finite matchability under the matroidal Hall's condition
• The almost intersection property for pairs of matroids on common groundset
• Intersection of a partitional and a general infinite matroid
• Intersecting set systems and graphic matroids
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• The Lovász-Cherkassky theorem in countable graphs

This page was built for publication: Proof of Nash-Williams' intersection conjecture for countable matroids

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