✦ LIBER ✦

Some Bounds for the Number of Blocks II

✍ Scribed by Ryuzaburou Noda

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 95 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0425

No coin nor oath required. For personal study only.

✦ Synopsis

The block sets achieving the bound β(i) with i = 2 in Proposition 0 is studied. It is proved that such block sets exist if and only if some t-designs with prescribed parameters exist (Theorem 1).

📜 SIMILAR VOLUMES

Some Bounds for the Number of Blocks

✍ Ryuzaburou Noda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Some natural upper bounds for the number of blocks are given. Only a few block sets achieving the bounds except trivial ones are known. Necessary conditions for the existence of such block sets are given.

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

New bounds for the chromatic number of g

New bounds for the chromatic number of graphs

✍ Manouchehr Zaker 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11. Next, we obtain an upper bound of the order of magnitude ${\cal O}({n}^{{1}-\epsilon})$ for the coloring number of a graph

Tamely Ramified Towers and Discriminant

Tamely Ramified Towers and Discriminant Bounds for Number Fields—II

✍ Farshid Hajir; Christian Maire 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 245 KB

The root discriminant of a number field of degree n is the nth root of the absolute value of its discriminant. Let R 0 (2m) be the minimal root discriminant for totally complex number fields of degree 2m, and put α 0 = lim infm R 0 (2m). Define R 1 (m) to be the minimal root discriminant of totally

Some new bounds for the maximum number o

Some new bounds for the maximum number of vertex colorings of a (v,e)-graph

✍ Byer, Owen D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

Let f (v, e, λ) denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in λ colors. In this paper we present some new upper bounds for f (v, e, λ). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T