𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdös

✍ Scribed by Li Yusheng

Publisher
Springer
Year
2001
Tongue
English
Weight
104 KB
Volume
46
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for the ramsey number of a discon
Bounds for the ramsey number of a disconnected graph versus any graph
✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 1 views

## Abstract Bounds are determined for the Ramsey number of the union of graphs versus a fixed graph __H__, based on the Ramsey number of the components versus __H__. For certain unions of graphs, the exact Ramsey number is determined. From these formulas, some new Ramsey numbers are indicated. In p

On the independence number of the Erdős-
On the independence number of the Erdős-Rényi and projective norm graphs and a related hypergraph
✍ Dhruv Mubayi; Jason Williford 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that