We investigate the local structure of twin tress, and produce for any semihomogeneous treeT a “universal twin” that contains, in a natural way, all trees twinned withT. Our methods allow us to show that there are uncountably many isomorphism classes of twinnings involving any semihomogeneous tree.info:eu-repo/semantics/publishe
Joint work wih Claude Laflamme, Norbert Sauer and Robert Woodrow. Two structures are said to be $\e...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractThe notions of abuilding [6]and, later, atwin building[7] were introduced to give an axiomat...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
AbstractWe give two topological characterizations of which subsets of ends of a tree T can be the tw...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
We classify twin buildings over tree diagrams such that all rank 2 residues are either finite Moufan...
AbstractWe give two topological characterizations of which subsets of ends of a tree T can be the tw...
this paper we prove that the extension is indeed unique, if the set of chambers opposite to a given ...
AbstractThis paper (which is the second part of a whole consisting of two parts) continues the inves...
AbstractConsider two locally finite rooted trees as equivalent if each of them is a topological mino...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
Joint work wih Claude Laflamme, Norbert Sauer and Robert Woodrow. Two structures are said to be $\e...
summary:Let $T$ be an infinite locally finite tree. We say that $T$ has exactly one end, if in $T$ a...
Joint work wih Claude Laflamme, Norbert Sauer and Robert Woodrow. Two structures are said to be $\e...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
AbstractThe notions of abuilding [6]and, later, atwin building[7] were introduced to give an axiomat...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
AbstractWe give two topological characterizations of which subsets of ends of a tree T can be the tw...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
We classify twin buildings over tree diagrams such that all rank 2 residues are either finite Moufan...
AbstractWe give two topological characterizations of which subsets of ends of a tree T can be the tw...
this paper we prove that the extension is indeed unique, if the set of chambers opposite to a given ...
AbstractThis paper (which is the second part of a whole consisting of two parts) continues the inves...
AbstractConsider two locally finite rooted trees as equivalent if each of them is a topological mino...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
Joint work wih Claude Laflamme, Norbert Sauer and Robert Woodrow. Two structures are said to be $\e...
summary:Let $T$ be an infinite locally finite tree. We say that $T$ has exactly one end, if in $T$ a...
Joint work wih Claude Laflamme, Norbert Sauer and Robert Woodrow. Two structures are said to be $\e...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
We show that a number of graph invariants are, even combined, insufficient to distinguish between no...
DOI
Add to ORKG