✦ LIBER ✦

An Anti-Ramsey Theorem on Cycles

✍ Scribed by J.J. Montellano-Ballesteros; V. Neumann-Lara

Publisher: Springer Japan
Year: 2005
Tongue: English
Weight: 152 KB
Volume: 21
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-005-0619-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Anti-Ramsey Theorem

✍ J. J. Montellano-Ballesteros; V. Neumann-Lara 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 138 KB

An Anti-Ramsey Theorem on Diamonds

✍ J. J. Montellano-Ballesteros 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 151 KB

Bipartite anti-Ramsey numbers of cycles

✍ Maria Axenovich; Tao Jiang; André Kündgen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract We determine the maximum number of colors in a coloring of the edges of __K~m,n~__ such that every cycle of length 2__k__ contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers __q__

On a Ramsey type theorem

✍ P. Erdős; A. Szemerédi 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 193 KB

Multi-dimensional Ramsey theorems — An e

Multi-dimensional Ramsey theorems — An example

✍ Amha Tume Lisan 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 110 KB

Two remarks on Ramsey's theorem

✍ Jaroslav Nes̆etr̆il; Vojtĕch Rödl 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 131 KB

We present a very simple proof of the fact (due to P. Erd~s and R. Rado) that Ram~ey's theorem doesn't hold for partitions of infinite subsets. We also present a proof of an induced Ramsey theorem for partitions of complete subgraphs (due to W. Deuber and authors) based on the theorem of R. Graham a