✦ LIBER ✦

Lower bounds for complete {k; n}-ARCS

✍ Scribed by Aiden A Bruen

Book ID: 103501932
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 84 KB
Volume: 33
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90085-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete k-arcs in PG(n, q), q even

✍ L. Storme; J.A. Thas 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 981 KB

Storme, L., J.A. Thas, Complete k-arcs in PG(n, q), q even, Discrete Mathematics 106/107 (1992) 455-469. This paper investigates the completeness of k-arcs in PG(n, q), q even. We determine all values of k for which there exists a complete k-arc in PG(n, q), q -2 2 n > q -G/2 -y. This is proven by u

Some lower bounds of the Ramsey numbers

Some lower bounds of the Ramsey numbers n(k, k)

✍ James P Burling; Steven W Reyner 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Drawing K2,n: A lower bound

✍ Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 81 KB

We give a tradeoff theorem between the area and the aspect ratio required by any planar straight-line drawing of K 2,n on the integer lattice. In particular we show that if the drawing is contained in a rectangle of area O(n) then the rectangle must have aspect ratio (n), and conversely, if the aspe

New lower bounds for the Capacitated Arc

New lower bounds for the Capacitated Arc Routing Problem

✍ Wen Lea Pearn 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

Improved upper and lower bounds for k-br

Improved upper and lower bounds for k-broadcasting

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

A lower bound for n-diameters

✍ I. F. Sharygin 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 217 KB