✦ LIBER ✦

Canonizing Ramsey theorems for finite graphs and hypergraphs

✍ Scribed by Hans Jürgen Prömel; Bernd Voigt

Book ID: 118319646
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 667 KB
Volume: 54
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90061-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ramsey—Turán type theorems for hyperg

On Ramsey—Turán type theorems for hypergraphs

✍ P. Erdős; Vera T. Sós 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 273 KB

Interpolation theorems for graphs, hyper

Interpolation theorems for graphs, hypergraphs and matroids

✍ Sanming Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Gallai theorems for graphs, hypergraphs,

Gallai theorems for graphs, hypergraphs, and set systems

✍ E.J. Cockayne; S.T. Hedetniemi; R. Laskar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 750 KB

New Lower Bounds for Ramsey Numbers of G

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs

✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,

Ramsey-Type Theorem for Spatial Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 299 KB

Coloring number and on-line Ramsey theor

Coloring number and on-line Ramsey theory for graphs and hypergraphs

✍ H. A. Kierstead; Goran Konjevod 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 479 KB