𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improvement of the Greenberg-low bound

✍ Scribed by A. Martin

Book ID
110652658
Publisher
Springer-Verlag
Year
1966
Weight
234 KB
Volume
42
Category
Article
ISSN
0369-3546

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Improvement of the Godsil Bound
An Improvement of the Godsil Bound
✍ Akira Hiraki; Jack Koolen πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 106 KB
An improvement of the Ivanov bound
An improvement of the Ivanov bound
✍ Akira Hiraki; Jack Koolen πŸ“‚ Article πŸ“… 1998 πŸ› Springer 🌐 English βš– 202 KB
An improvement of the crossing number bo
An improvement of the crossing number bound
✍ Bernard Montaron πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

## Abstract The crossing number __cr__(__G__) of a simple graph __G__ with __n__ vertices and __m__ edges is the minimum number of edge crossings over all drawings of __G__ on the ℝ^2^ plane. The conjecture made by ErdΕ‘s in 1973 that __cr__(__G__) β‰₯ __Cm__^3^/__n__^2^ was proved in 1982 by Leighton

An Improvement of the Boshier-Nomura Bou
An Improvement of the Boshier-Nomura Bound
✍ A. Hiraki πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 93 KB

We show that the number of columns \(\left(c_{i}, a_{i}, b_{i}\right)=(1,1, k-2)\) in the intersection arrays of distance-regular graphs is at most three if the column \((1,0, k-1)\) exists. This improves the Bosheir-Nomura bound from four to three. 1994 Academic Press, Inc.