𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Erdős-Sós conjecture for graphs of girth 5

✍ Scribed by Stephan Brandt; Edward Dobson

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
167 KB
Volume
150
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Erdős-Sós Conjecture for trees of di
The Erdős-Sós Conjecture for trees of diameter four
✍ Andrew McLennan 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

## Abstract The Erdős‐Sós Conjecture is that a finite graph __G__ with average degree greater than __k__ − 2 contains every tree with __k__ vertices. Theorem 1 is a special case: every __k__‐vertex tree of diameter four can be embedded in __G__. A more technical result, Theorem 2, is obtained by ex

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

Tutte's 5-flow conjecture for graphs of
Tutte's 5-flow conjecture for graphs of nonorientable genus 5
✍ Steffen, Eckhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

We develop four constructions for nowhere-zero 5-flows of 3-regular graphs that satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-Flow Conjecture is of order 244 and therefore every bridgeless graph of nonorientable genus 5 5 has a nowhere

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