𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bridges of longest circuits and path coverings of labelled trees

✍ Scribed by H. -J. Voss

Book ID
105327235
Publisher
Springer Netherlands
Year
1982
Tongue
English
Weight
812 KB
Volume
13
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On size Ramsey number of paths, trees, a
On size Ramsey number of paths, trees, and circuits. I
✍ JΓ³Zsef Beck πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 622 KB

## Abstract The __size Ramsey number Ε™__(__G__) of a graph __G__ is the smallest integer Ε™ such that there is a graph __F__ of Ε™ edges with the property that __any__ two‐coloring of the edges of __F__ yields a monochromatic copy of __G__. First we show that the size Ramsey number Ε™(__P~n~__) of the