✦ LIBER ✦

Borel partitions of infinite subtrees of a perfect tree

✍ Scribed by A. Louveau; S. Shelah; B. Veličković

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 825 KB
Volume: 63
Category: Article
ISSN: 0168-0072
DOI: 10.1016/0168-0072(93)90151-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The subtree center of a tree

✍ Nieminen, Juhani; Peltola, Matti 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 2 views

A method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given.

Representations of chordal graphs as sub

Representations of chordal graphs as subtrees of a tree

✍ James R. Walter 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

A minimum-length covering subtree of a t

A minimum-length covering subtree of a tree

✍ Tae Ung Kim; Timothy J. Lowe; James E. Ward; Richard L. Francis 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 1019 KB

The Borel hierarchy is infinite in the c

The Borel hierarchy is infinite in the class of regular sets of trees

✍ Jerzy Skurczyński 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Least central subtrees, center, and cent

Least central subtrees, center, and centroid of a tree

✍ Martti Hamina; Matti Peltola 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

On the average number of nodes in a subt

On the average number of nodes in a subtree of a tree

✍ Robert E Jamison 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 844 KB