An optimal problem in graph theory
β Scribed by M. A. Dukhovnyi
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1971
- Tongue
- English
- Weight
- 207 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A general upper bound for the tail of the compound negative binomial distribution is constructed. By establishing a connection with the individual risk mode the upper bound is seen to be a (possibly degenerate) mixture of tails of gamma distribution. The bound is sharp in that it is an equality in t
Given two graphs G=(X,E), H=(Y,F); If AcX and if f is a function from A to Y, we pose the problem of deciding if f can be extended into a homomorphism from G to H. We know how to solve this problem when H is, for instance, a tree, or a chordal graph. We give here a solution to this problem when g is
## Abstract The aim of this note is to give an account of some recent results and state a number of conjectures concerning extremal properties of graphs.