The upper bound graphs that arise from exactly one (up to isomorphism) poser :~rc characterized. Weakening these conditions, the class of graphs whose intersection number is equal to the independence number is characterized. In this note all sets are finite and all graphs are connected, undirected,
Some upper bounds for minimal trees
β Scribed by J.M. Basart
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 553 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we derive some upper bounds for the relative entropy D(p 11 q) of two probability distribution and apply them to mutual information and entropy mapping. To achieve this, we use an inequality for the logarithm function, (2.3) below, and some classical inequalities such as the Kantorovi
New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra
We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.
We prove the existence of second weak derivatives for bounded minimizers u: This allows us to improve on the Hausdorff dimension of the singular set of u.