✦ LIBER ✦

On the number of combinations without a fixed distance

✍ Scribed by Helmut Prodinger

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 141 KB
Volume: 35
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90019-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of subsets without a fixed ci

The number of subsets without a fixed circular distance

✍ W.O.J Moser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 102 KB

On the number of combinations without un

On the number of combinations without unit separation

✍ John Konvalina 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Fixed Points on the Real Numbers without

Fixed Points on the Real Numbers without the Equality Test

✍ M.V. Korovina 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Report of a workshop on fixed-ratio drug

Report of a workshop on fixed-ratio drug combinations

✍ Hans J. Dengler; Louis Lasagna 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 748 KB

On the chromatic number of special dista

On the chromatic number of special distance graphs

✍ M. Voigt; H. Walther 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 153 KB

## A b&act Voigt, M. and H. Walther, On the chromatic number of special distance graphs, Discrete Mathematics 97 (1991) 395-397. For all 12 10 and u 2 1' -61+ 3 the chromatic number is proved to be 3 for distance graphs with all integers as vertices, and edges only if the vertices are at distance

On graphs with a fixed number of negativ

On graphs with a fixed number of negative eigenvalues

✍ Aleksander Torgašev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Let P(n) be the class of all connected graphs having exactly n ~> 1 negative eigenvalues (including their multiplicities). In this paper we prove that the class P(n) contains only finitely many so-called canonical graphs. The analogous statement for the class Q(n) of all connected graphs having exac