✦ LIBER ✦

Partitioning infinite trees

✍ Scribed by Peter Horak; Katherine Heinrich

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 153 KB
Volume: 34
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200006)34:2<113::aid-jgt1>3.0.co;2-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning by Monochromatic Trees

✍ P.E. Haxell; Y. Kohayakawa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Any r-edge-coloured n-vertex complete graph K n contains at most r monochromatic trees, all of different colours, whose vertex sets partition the vertex set of K n , provided n 3r 4 r! (1&1Âr) 3(1&r) log r. This comes close to proving, for large n, a conjecture of Erdo s, Gya rfa s, and Pyber, which

Partitioning of biweighted trees

✍ Alessandro Agnetis; Pitu B. Mirchandani; Andrea Pacifici 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Partitioning complete multipartite graph

Partitioning complete multipartite graphs by monochromatic trees

✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c

Integer Partitions and Binary Trees

✍ Frank Schmidt 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 82 KB

We present observations and problems connected with a weighted binary tree representation of integer partitions.  2002 Elsevier Science (USA)

Optimality of consecutive and nested tre

Optimality of consecutive and nested tree partitions

✍ Chang, G. J.; Hwang, F. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons

Induction of decision trees using fuzzy

Induction of decision trees using fuzzy partitions

✍ A. J. Myles; S. D. Brown 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB