Trees, Ends, and Transience

Carsten Thomassen
Additional contact information
Carsten Thomassen: Technical University of Denmark, Mathematical Institute

A chapter in Harmonic Analysis and Discrete Potential Theory, 1992, pp 259-266 from Springer

Abstract: Abstract Many proofs in graph theory use (spanning) trees which preserve a certain property of the graph. We discuss some recent results on spanning trees with the same shape (more precisely, the same end structure) as the graph and on transient subtrees. A general sufficient condition, in terms of isoperimetric inequalities, for a transient subtree is presented.

Keywords: Riemannian Manifold; Span Tree; Connected Graph; Isoperimetric Inequality; Simple Random Walk (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4899-2323-3_21

Ordering information: This item can be ordered from
http://www.springer.com/9781489923233

DOI: 10.1007/978-1-4899-2323-3_21

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().