𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Jason P Bell

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
97 KB
Volume
87
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

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 s conjectured that the ratio p (k+1)

). We prove this conjecture.

📜 SIMILAR VOLUMES

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.

Squaring a tournament: A proof of Dean's
Squaring a tournament: A proof of Dean's conjecture
✍ Fisher, David C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 2 views

Let the square of a tournament be the digraph on the same nodes with arcs where the directed distance in the tournament is at most two. This paper verifies Dean's conjecture: any tournament has a node whose outdegree is at least doubled in its square. 0

Proof of a Conjecture of Bollob?s on Nes
Proof of a Conjecture of Bollob?s on Nested Cycles
✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

A Proof of Reutenauer's −q(n)Conjecture
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.