I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii The central theme of this thesis is to prove results about infinite mathematical objects by studying the behaviour of their finite substructures. In particular, we study B-matroids, which are an infinite generalization of matroids introduced by Higgs [13], and graph-like spaces, which are topological spaces resembling graphs, introduced by Thomassen and Vella [27]. Recall that the circuit matroid of a finite graph is a matroid defined on the edges of the graph, with a set of edges being independent...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
We give axiomatic foundations for infinite matroids with duality, in terms of independent sets, base...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
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...
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...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
B-matroids are a class of pre-independence spaces which retain many important properties of independ...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
AbstractIt has recently been shown that infinite matroids can be axiomatized in a way that is very s...
We prove that the topological cycles of an arbitrary infinite graph together with its topological en...
AbstractA matroidal family C is defined to be a collection of graphs such that, for any given graph ...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
We give axiomatic foundations for infinite matroids with duality, in terms of independent sets, base...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
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...
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...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
B-matroids are a class of pre-independence spaces which retain many important properties of independ...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
AbstractIt has recently been shown that infinite matroids can be axiomatized in a way that is very s...
We prove that the topological cycles of an arbitrary infinite graph together with its topological en...
AbstractA matroidal family C is defined to be a collection of graphs such that, for any given graph ...
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that th...
We give axiomatic foundations for infinite matroids with duality, in terms of independent sets, base...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...