The Borsuk–Ulam-property, Tucker-property and constructive proofs in combinatorics-Reference-Cited by-同舟云学术

The Borsuk–Ulam-property, Tucker-property and constructive proofs in combinatorics

Published:2006-07 Issue:5 Volume:113 Page:839-850
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

de Longueville Mark,Živaljević Rade T.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference26 articles.

1. Proofs from The Book;Aigner,2004

2. Splitting Necklaces;Alon;Adv. Math.,1987

3. N. Alon, Non-constructive proofs in combinatorics, Proceedings of the International Congress on Mathematics, Kyoto/Japan, vol. II(1991), 1990, pp. 1421–1429.

4. A generalization of Charathéodory's theorem;Bárány;Discrete Math.,1982

5. I. Bárány, S. Onn, Charathéodory's theorem colorful and applicable, in: I. Bárány, K. Böröczky (Eds.), Intuitive Geometry, Bolyai Society of Mathematical Studies, vol. 6, pp. 11–22.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich;SIAM Journal on Computing;2022-02-28

2. The classes PPA-k: Existence from arguments modulo k;Theoretical Computer Science;2021-09

3. The complexity of splitting necklaces and bisecting ham sandwiches;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

4. The Classes PPA-k: Existence from Arguments Modulo k;Web and Internet Economics;2019

5. Strengthening topological colorful results for graphs;European Journal of Combinatorics;2017-08