On degrees of vertices in paradoxical trees

W. A. Deuber, A. V. Kostochka

Research output: Contribution to journalArticlepeer-review


We present some necessary and sufficient conditions (in terms of degrees of vertices) for locally finite tree T=(V,E) to be paradoxical, i.e. to have a partition V=V1∪V2 and one-to-one mappings fi : V → Vi, i=1,2 such that the supremum of the distances between v and fi(v) over v ∈ V and i = 1,2 is finite.

Original languageEnglish (US)
Pages (from-to)53-59
Number of pages7
JournalDiscrete Mathematics
Issue number1-2
StatePublished - Feb 6 2000
Externally publishedYes


  • Locally finite trees
  • Vertex degrees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On degrees of vertices in paradoxical trees'. Together they form a unique fingerprint.

Cite this