## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ Β© 1993 John Wiley & Sons, Inc.
Upper and lower bounds for a pattern bombing problem
β Scribed by Alan R. Washburn
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 403 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Most engineering problems are solved by means of numerical methods that are able to provide only approximate solutions, for which it would be extremely useful to have efficient error estimators. Upper and lower bounds for quantities of integral character, like the stored magnetic energy or the ohmi
We give upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group W . If W is finite we prove that, for any k β₯ 0, the kth coefficient of the Kazhdan-Lusztig polynomial of two elements u, v of W is bounded from above by a polynomial (which depends only on k) in l(v)l(u). In par