✦ LIBER ✦

A combinatorial problem with applications to geometry

✍ Scribed by Carl Maneri; Robert Silverman

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 160 KB
Volume: 11
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(71)90036-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem in combinatorial geometry

✍ Vojtěch Rödl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let us fix a number a, O< a < 2. We join two p0int.s on the unit sphere Sm in the real m-space iff their distance is a. Denote the obtained graph by g,,,. We prove that the chromatic number x(9@,,,) tends to infinity when m --+ a. This gives a positive answer to a question of P. Erdiis.

A categorical approach to combinatorial

A categorical approach to combinatorial geometry

✍ William H Graves 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 542 KB

An Application of Logic to Combinatorial

An Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube?

✍ Vladik Kreinovich; Olga Kosheleva 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 1 views

## Abstract It is known (see Rapp [9]) that elementary geometry with the additional quantifier “there exist uncountably many” is decidable. We show that this decidability helps in solving the following problem from combinatorial geometry: does there exist an uncountable family of pairwise non‐congr

Applications of algebraic and combinator

Applications of algebraic and combinatoric techniques to a problem in geometry

✍ Mohan S. Putcha; Alan H. Schoenfeld 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Applications of coding theory to communi

Applications of coding theory to communication combinatorial problems

✍ Gérard D. Cohen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Nous prtsentons une synthese et quelques resultats sur l'emploi de techniques emprunttes aux codes correcteurs d'erreurs pour la solution de probltmes combinatoires dans le domaine des communications. Les questions aborddes sont essentiellement les suivantes: -resolution de conflit avec feedback dan

An application of the combinatorial Null

An application of the combinatorial Nullstellensatz to a graph labelling problem

✍ Dan Hefetz; Annina Saluz; Huong T. T. Tran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract An __antimagic labelling__ of a graph __G__ with __m__ edges and __n__ vertices is a bijection from the set of edges of __G__ to the set of integers {1,…,__m__}, such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with tha