Handbook of discrete and computational geometry
A Combinatorial Proof of Kneser’s Conjecture
Combinatorica
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
Computing solutions of the paintshop-necklace problem
Computers and Operations Research
| Hi-index | 0.00 |
This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.