𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems

✍ Scribed by Noga Alon

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
167 KB
Volume
7
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an anti-Ramsey problem of Burr, Erdős
On an anti-Ramsey problem of Burr, Erdős, Graham, and T. Sós
✍ Gábor N. Sárközy; Stanley Selkow 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract Given a graph __L__, in this article we investigate the anti‐Ramsey number χ~__S__~(n,e,L), defined to be the minimum number of colors needed to edge‐color some graph __G__(__n__,__e__) with __n__ vertices and __e__ edges so that in every copy of __L__ in __G__ all edges have different

Proof of a Conjecture of Bollobás and Ko
Proof of a Conjecture of Bollobás and Kohayakawa on the Erdős–Stone Theorem
✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

For any integer r \ 1, let a(r) be the largest constant a \ 0 such that if E > 0 and 0 < c < c 0 for some small c 0 =c 0 (r, E) then every graph G of sufficiently large order n and at least edges contains a copy of any (r+1)-chromatic graph H of independence number a(H) [ (a -E) log n log(1/c) .

Proof of a Conjecture of Mader, Erdös an
Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
✍ B. Bollobás; A. Thomason 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We show that every graph G of size at least 256 p 2 |G| contains a topological complete subgraph of order p. This slight improvement of a recent result of Komlós and Szemerédi proves a conjecture made by Mader and by Erdös and Hajnal.