✦ LIBER ✦

Locally Ramsey properties of graphs

✍ Scribed by S. G. Sal'nikov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1988
Tongue: English
Weight: 382 KB
Volume: 43
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01139574

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey properties of random graphs

✍ Tomasz Luczak; Andrzej Ruciński; Bernd Voigt 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 917 KB

Ramsey Properties of Families of Graphs

✍ Ronald Graham; Tomasz Łuczak; Vojtěch Rödl; Andrzej Ruciński 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

For a graph F and natural numbers a 1 ; . . . ; a r ; let F ! ða 1 ; . . . ; a r Þ denote the property that for each coloring of the edges of F with r colors, there exists i such that some copy of the complete graph K ai is colored with the ith color. Furthermore, we write ða 1 ; . . . ; a r Þ ! ðb

Vertex Ramsey Properties of Families of

Vertex Ramsey Properties of Families of Graphs

✍ Tomasz Łuczak; Andrzej Ruciński; Sebastian Urbański 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 118 KB

For graphs F, G 1 , ..., G r , we write F Q (G 1 , ..., G r ) if for every coloring of the vertices of F with r colors there exists i, i=1, 2, ..., r, such that a copy of G i is colored with the ith color. For two families of graphs G 1 , ..., G r and H 1 , ..., H s , by .., H s ) for every graph F

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

A Ramsey property for graph invariants

✍ Fred Buckley 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

## Abstract We consider the problem of which graph invariants have a certain property relating to Ramsey's theorem. Invariants which have this property are called Ramsey functions. We examine properties of chains of graphs associated with Ramsey functions. Methods are developed which enable one to

Local and meank-Ramsey numbers for compl

Local and meank-Ramsey numbers for complete graphs

✍ Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 2 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.