✦ LIBER ✦

Duality and Lower Bounds for Relative Projection Constants

✍ Scribed by K. Petras

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 441 KB
Volume: 81
Category: Article
ISSN: 0021-9045
DOI: 10.1006/jath.1995.1035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for Seshadri constants

✍ Thomas Eckl 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract One of Demailly's characterization of Seshadri constants on ample line bundles works with Lelong numbers of certain positive singular hermitian metrics. In this note this is translated into algebraic terms by using sections of multiples of the line bundle. The resulting formula for Sesh

Lower bounds for two-period grooming via

Lower bounds for two-period grooming via linear programming duality

✍ Charles J. Colbourn; Gaetano Quattrocchi; Violet R. Syrotiuk 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## 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.

Lower bounds for lower Ramsey numbers

✍ Ralph Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract For any graph __G__, let __i__(__G__) and μ;(__G__) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers __m__ and __n__, the lower Ramsey number __s__(__m, n__) is the largest integer __p__ so that every graph of or

Lower bounds for linear interval routing

✍ Eilam, T.; Moran, S.; Zaks, S. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro