𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of P. Landrock

✍ Scribed by Tetsuro Okuyama; Yukio Tsushima

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
308 KB
Volume
104
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the P�sa-Seymour conjecture
On the P�sa-Seymour conjecture
✍ Koml�s, J�nos; S�rk�zy, G�bor N.; Szemer�di, Endre 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

Paul Seymour conjectured that any graph G of order n and minimum degree at least k k+1 n contains the k th power of a Hamilton cycle. We prove the following approximate version. For any > 0 and positive integer k, there is an n 0 such that, if G has order n ≥ n 0 and minimum degree at least ( k k+1

On a Conjecture of Chalk
On a Conjecture of Chalk
✍ Ping Ding 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let f # Z[x] with degree k and let p be a prime. By a complete trigonometric sum we mean a sum of the form S(q, f )= q x=1 e q ( f (x)), where q is a positive integer and e q (:)=exp(2?if (x)Âq). Professor Chalk made a conjecture on the upper bound of S(q, f ) when q is a prime power. We prove Chalk

On a Conjecture of Woodall
On a Conjecture of Woodall
✍ Hao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Dirac proved in 1952 that every 2-connected graph of order n and minimum degree k admits a cycle of length at least minfn; 2kg: As a possible improvement, Woodall conjectured in 1975 that if a 2-connected graph of order n has at least n 2 þ k vertices of degree at least k; then it has a cycle of len