✦ LIBER ✦

-Ramsey classes of graphs

✍ Scribed by Mieczysław Borowiecki; Anna Fiedorowicz

Book ID: 119227513
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 243 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.02.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classes of Graphs that Are Not Vertex Ra

Classes of Graphs that Are Not Vertex Ramsey

✍ Kierstead, H. A. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 238 KB

For graphs there are only four types of

For graphs there are only four types of hereditary Ramsey classes

✍ Jaroslav Nešetřil 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Sparse ramsey graphs

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 346 KB

Ramsey classes of set systems

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Generalized Ramsey theory for graphs IV,

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

✍ F. Harary; G. Prins 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

Sparse Anti-Ramsey Graphs

✍ Y. Kohayakawa; T. Luczak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

It is shown that for every \(l \geqslant 3\) there exists a graph \(G\) of girth / such that in any proper edge-colouring of \(G\) one may find a cycle of length / all of whose edges are given different colours. 1995 Academic Press. Inc.