𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Ramsey numbers of uniform hypergraphs with given maximum degree

✍ Scribed by A.V. Kostochka; V. Rödl

Book ID
108167177
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
143 KB
Volume
113
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Induced Ramsey Numbers for Graphs wit
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
✍ Tomasz Łuczak; Vojtěch Rödl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 435 KB

For graphs G and H we write G wÄ ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wÄ ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every