𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


An optimization problem on graphs
✍ Ding-Zhu Du πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 151 KB
An optimal stopping problem in risk theo
✍ U. Jensen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 105 KB

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

The optimal graph partitioning problem
✍ SΓΈren Holm; Michael Malmros SΓΈrensen πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 German βš– 791 KB
A retraction problem in graph theory
✍ Alain Quilliot πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 563 KB

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

Extremal problems in graph theory
✍ BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 304 KB

## 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.