Add to ORKGIn this paper several infinite extensions of the well-known results for packing bases in finite matroids are considered. A counterexample is given to a conjecture of Nash-Williams on edge-disjoint spanning trees of countable graphs, and a sufficient condition is proved for the packing problem in independence spaces over a countably infinite set. © 1979
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...
AbstractIn this paper several infinite extensions of the well-known results for packing bases in fin...
AbstractIn this paper several infinite extensions of the well-known results for packing bases in fin...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large d...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnectoris a set of edgesF...
AbstractThe main result of the paper is a characterization of connected graphs H with the property: ...
B-matroids are a class of pre-independence spaces which retain many important properties of independ...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...
AbstractIn this paper several infinite extensions of the well-known results for packing bases in fin...
AbstractIn this paper several infinite extensions of the well-known results for packing bases in fin...
AbstractWe give a short elementary proof of Tutte and Nash-Williams’ characterization of graphs with...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
This thesis is in two parts. The first two chapters deal with infinite matroids and the remaining th...
In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large d...
AbstractGiven an undirected graphG=(V,E) and a partition {S,T} ofV, anS−Tconnectoris a set of edgesF...
AbstractThe main result of the paper is a characterization of connected graphs H with the property: ...
B-matroids are a class of pre-independence spaces which retain many important properties of independ...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen...