𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An exponential SRGM with a bound on the number of failures

✍ Scribed by P.K. Kapur; Shakti Bhushan; Said Younes

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
305 KB
Volume
33
Category
Article
ISSN
0026-2714

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Exponential bounds on the number of desi
Exponential bounds on the number of designs with affine parameters
✍ David Clark; Dieter Jungnickel; Vladimir D. Tonchev πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract It is well‐known that the number of designs with the parameters of a classical design having as blocks the hyperplanes in __PG__(__n, q__) or __AG__(__n, q__), __n__β‰₯3, grows exponentially. This result was extended recently [D. Jungnickel, V. D. Tonchev, Des Codes Cryptogr, published on

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