Circuit-partition of infinite matroids
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912589263405056 |
|---|---|
| author | Bowler, Nathan Joó, Attila |
| author_facet | Bowler, Nathan Joó, Attila |
| contents | Komjáth, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit such a partition. Their proof is based on Shelah's singular compactness technique and a careful analysis of certain $\triangle$-systems.
We provide a short, simple proof of their theorem. Then we show that a finitary binary oriented matroid can be partitioned into directed circuits if and only if, in every cocircuit, the cardinality of the negative and positive edges is the same. This generalizes an earlier conjecture of Thomassen, settled affirmatively by the second author, about partitioning the edges of an infinite directed graph into directed cycles. As side results, a Laviolette theorem for finitary matroids and a Farkas lemma for finitary binary oriented matroids are proven. An example is given to show that, in contrast to finite oriented matroids, `binary' is essential in the latter result. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_12811 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Circuit-partition of infinite matroids Bowler, Nathan Joó, Attila Combinatorics Komjáth, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit such a partition. Their proof is based on Shelah's singular compactness technique and a careful analysis of certain $\triangle$-systems. We provide a short, simple proof of their theorem. Then we show that a finitary binary oriented matroid can be partitioned into directed circuits if and only if, in every cocircuit, the cardinality of the negative and positive edges is the same. This generalizes an earlier conjecture of Thomassen, settled affirmatively by the second author, about partitioning the edges of an infinite directed graph into directed cycles. As side results, a Laviolette theorem for finitary matroids and a Farkas lemma for finitary binary oriented matroids are proven. An example is given to show that, in contrast to finite oriented matroids, `binary' is essential in the latter result. |
| title | Circuit-partition of infinite matroids |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.12811 |