Almost all trees have tribe number 2 or 3 (Q1897446): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Hans L. Bodlaender / rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans L. Bodlaender / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q115927660 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0013-t / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1998185014 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:05, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Almost all trees have tribe number 2 or 3 |
scientific article |
Statements
Almost all trees have tribe number 2 or 3 (English)
0 references
27 August 1995
0 references
For a fixed \(\varepsilon\leq 1/2\), the tribe number \(t_T(\varepsilon)\) of \(T\) is defined as the smallest integer \(r\), such that for every vertex \(v\) in \(T\), the forest obtained from deleting \(v\) from \(T\) contains a collection of at most \(r\) trees that contain together more than \((1- \varepsilon)n\) vertices (\(n\) denoting the number of vertices of \(T\)). The tribe number of a tree can be arbitrarily large. However, as is shown in this paper, almost every tree has tribe number 2 or 3 (with respect to any fixed \(\varepsilon\leq 1/2\)).
0 references
tribe number
0 references
forest
0 references
tree
0 references