✦ LIBER ✦

Pelikán's conjecture and cyclotomic cosets

✍ Scribed by F.J. MacWilliams; A.M. Odlyzko

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 238 KB
Volume: 22
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(77)90070-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a conjecture of Erdös and Turán

✍ Eric Schmutz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Chvátal's conjecture and point-intersect

Chvátal's conjecture and point-intersections

✍ Peter Stein 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On a conjecture of bollobás and bosák

✍ Štefan Znám 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

## Abstract It is shown that, for all sufficiently large __k__, the complete graph __K~n~__ can be decomposed into __k__ factors of diameter 2 if and only if __n__ ≥ 6__k__.

Generalized additive bases, König's lemm

Generalized additive bases, König's lemma, and the Erdős–Turán conjecture

✍ Melvyn B. Nathanson 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h; let r A ðn; hÞ denote the number of representations of n in the form n where a 1 ; a 2 ; y; a h AA and a 1 pa 2 p?pa h : The infinite set A is called a basis of order h if r A ðn; hÞX1 for every nonnegat

Subcontraction-equivalence and Hadwiger'

Subcontraction-equivalence and Hadwiger's conjecture

✍ D. R. Woodall 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 350 KB

The concept of subcontraction-equivalence is defined, and 14 graphtheoretic properties are exhibited that are all subcontraction-equivalent if Hadwiger's conjecture is true. Some subsets of these properties are proved to be subcontraction-equivalent anyway. Hadwiger's conjecture is expressed as the

Fair reception and Vizing's conjecture

✍ Boštjan Brešar; Douglas F. Rall 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract In this paper we introduce the concept of fair reception of a graph which is related to its domination number. We prove that all graphs __G__ with a fair reception of size γ(__G__) satisfy Vizing's conjecture on the domination number of Cartesian product graphs, by which we extend the w