We prove that the topological cycles of an arbitrary infinite graph together with its topological ends form a matroid. This matroid is, in general, neither finitary nor cofinitary.Emmanuel Colleg
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...
We introduce the nearly finitary matroids which form a superclass of the finitary matroids, and prov...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractIt has recently been shown that infinite matroids can be axiomatized in a way that is very s...
We summarize and present recent results in the field of infinite matroid theory. We define and prove...
We summarize and present recent results in the field of infinite matroid theory. We define and prove...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractB-matroids are a class of pre-independence spaces which retain many important properties of ...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...
We introduce the nearly finitary matroids which form a superclass of the finitary matroids, and prov...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractIt has recently been shown that infinite matroids can be axiomatized in a way that is very s...
We summarize and present recent results in the field of infinite matroid theory. We define and prove...
We summarize and present recent results in the field of infinite matroid theory. We define and prove...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answ...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractB-matroids are a class of pre-independence spaces which retain many important properties of ...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...
We introduce the nearly finitary matroids which form a superclass of the finitary matroids, and prov...
DOI
Add to ORKG