Add to ORKGWe present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs such that F is an antichain with respect to the minor relation and, for every graph G in F, both G1 and G2 are subgraphs of G but no graph obtained from G by deletion or contraction of an edge has both G1 and G2 as minors. These graphs show that the extension to infinite graphs of the intertwining conjecture of Lovász, Milgram, and Ungar fails. © 1993 Academic Press, Inc
AbstractThis expository article describes work which has been done on various problems involving inf...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractWe present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs s...
Two graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper, we giv...
Abstract. A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending o...
This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-conn...
AbstractA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on ...
AbstractTwo graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper...
ABSTRACT. An intertwine of a pair of matroids is a matroid such that it, but none of its proper mino...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
AbstractThis expository article describes work which has been done on various problems involving inf...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractWe present a construction of two infinite graphs G1, G2 and of an infinite set F of graphs s...
Two graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper, we giv...
Abstract. A graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending o...
This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-conn...
AbstractA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on ...
AbstractTwo graphs are minor-equivalent if each is isomorphic to a minor of the other. In this paper...
ABSTRACT. An intertwine of a pair of matroids is a matroid such that it, but none of its proper mino...
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a min...
AbstractRobertson and Seymour have shown that there is no infinite set of graphs in which no member ...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
Geelen, Gerards, and Whittle have announced that there are no infinite sets of binary matroids none ...
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation. In other word...
AbstractThis expository article describes work which has been done on various problems involving inf...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...