𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

✍ Scribed by F. Franek; V. Rödl

Publisher
Springer Japan
Year
1992
Tongue
English
Weight
461 KB
Volume
8
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On ramsey numbers of forests versus near
On ramsey numbers of forests versus nearly complete graphs
✍ Gary Chartrand; Ronald J. Gould; Albert D. Polimeni 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

## Abstract A formula is presented for the ramsey number of any forest of order at least 3 versus any graph __G__ of order __n__ ≥ 4 having clique number __n__ ‐ 1. In particular, if __T__ is a tree of order __m__ ≥ 3, then __r(T, G)__ = 1 + (__m__ ‐ 1)(__n__ ‐ 2).

On the Ramsey multiplicities of graphs—p
On the Ramsey multiplicities of graphs—problems and recent results
✍ Stefan A. Burr; Vera Rosta 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

## Abstract Ramsey's theorem guarantees that if __G__ is a graph, then any 2‐coloring of the edges of a large enough complete graph yields a monochromatic copy of __G__. Interesting problems arise when one asks how many such __G__ must occur. A survey of this and related problems is given, along wi