✦ LIBER ✦

Proof of a conjecture of Erdös and Turán

✍ Scribed by Eric Schmutz

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 514 KB
Volume: 31
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(89)90073-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Proof of a Partition Conjecture of Bat

A Proof of a Partition Conjecture of Bateman and Erdős

✍ Jason P Bell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Bateman and Erdo s found necessary and sufficient conditions on a set A for the kth differences of the partitions of n with parts in A, p (k) A (n), to eventually be positive; moreover, they showed that when these conditions occur p (k+1) A (n) tends to zero as n tends to infinity. Bateman and Erdo

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.

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) .

On a conjecture of M. N. Bleicher and P.

On a conjecture of M. N. Bleicher and P. Erdös

✍ Hisashi Yokota 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 206 KB

On A Problem of Erdős and Turán and Some

On A Problem of Erdős and Turán and Some Related Results

✍ N. Alon; M.N. Kolountzakis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 315 KB

We employ the probabilistic method to prove a stronger version of a result of Helm, related to a conjecture of Erdos and Turan about additive bases of the positive integers. We show that for a class of random sequences of positive integers \(A\), which satisfy \(|A \cap[1, x]| \gg \sqrt{x}\) with pr

A Proof of Reutenauer's −q(n)Conjecture

✍ William F. Doran IV 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 181 KB

C. Reutenauer (Adv. in Math. 110 (1995), 234 246) has defined a new class of symmetric functions q \* indexed by partitions \*. He conjectures that for n 2, &q (n) is the sum of Schur symmetric functions. This paper provides a proof of his conjecture.