Loading...
Please wait, while we are loading the content...
Similar Documents
Normal tree orders for infinite graphs.
| Content Provider | CiteSeerX |
|---|---|
| Author | Brochet, J. -M. Diestel, R. |
| Abstract | this paper is to see how a classical and powerful structural device for the study of countable graphs, the notion of a normal spanning tree, can be made available more generally. The existence of such spanning trees, while trivial in the finite case (where they are better known as depth-first search trees), is in general limited to countable graphs. By generalizing the graph theoretical trees involved to order theoretical trees, a concept better suited to express uncountably long `ends', we shall be able to extend the classical existence theorems for normal trees to arbitrary cardinalities, while retaining much of their original strength. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Infinite Graph Normal Tree Order Countable Graph Finite Case Normal Spanning Tree Classical Existence Theorem Original Strength Powerful Structural Device Order Theoretical Tree Depth-first Search Tree Normal Tree Graph Theoretical Tree Arbitrary Cardinality |
| Content Type | Text |
| Resource Type | Article |
