End-faithful spanning trees of countable graphs with prescribed sets of rays

Title:

End-faithful spanning trees of countable graphs with prescribed sets of rays

Creator:

Polat, Norbert

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:ff68b1ac-b9e5-47d5-bb1d-17df23207528
uuid:ff68b1ac-b9e5-47d5-bb1d-17df23207528

Subject:

math, countable graphs, and prescribed sets of rays

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Širáň Theorem 1.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

45-53

Source:

Czechoslovak Mathematical Journal | 2001 Volume:51 | Number:1

Harvested from:

CDK

Metadata only:

false