✦ LIBER ✦

An Improvement of the Boshier-Nomura Bound

✍ Scribed by A. Hiraki

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 93 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1025

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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 improved bound for the strong chromat

An improved bound for the strong chromatic number

✍ P. E. Haxell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(η) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ ≥ __d__~0~ whose vertex set is partitioned into classes of size α __d__, where α≥ 11/4 + η. Then there exists a proper coloring of __

An improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph

An improvement on perturbation bounds fo

An improvement on perturbation bounds for the Drazin inverse

✍ Yimin Wei; Xiezhang Li 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

An improved edge bound on the interval n

An improved edge bound on the interval number of a graph

✍ Jeremy R. Spinrad; G. Vijayan; Douglas B. West 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

The upper bound on the interval number of a graph in terms of its number of edges is improved. Also, the interval number of graphs in hereditary classes is bounded in terms of the vertex degrees. A representation of a graph as an intersection graph assigns each vertex a set such that vertices are a

Improved Bounds on the Sample Complexity

Improved Bounds on the Sample Complexity of Learning

✍ Yi Li; Philip M. Long; Aravind Srinivasan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit