Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference15 articles.
1. Čadek, M., Krčál, M., Matoušek, J., Vokřínek, L., Wagner, U.: Extendability of continuous maps is undecidable. Discrete Comput. Geom. 51(1), 24–66 (2014)
2. Filakovský, M., Wagner, U., Zhechev, S.: Embeddability of simplicial complexes is undecidable. In: 31st ACM-SIAM Symposium on Discrete Algorithms (Salt Lake City 2020), pp. 767–785. SIAM, Philadelphia (2020)
3. Haefliger, A.: Differentiable links. Topology 1, 241–244 (1962)
4. Karasev, R., Skopenkov, A.: Some ‘converses’ to intrinsic linking theorems. Discrete Comput. Geom. (to appear)
5. Matoušek, J.: Using the Borsuk–Ulam Theorem. Universitext. Springer, Berlin (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adjacency Graphs of Polyhedral Surfaces;Discrete & Computational Geometry;2023-10-18
2. Some ‘Converses’ to Intrinsic Linking Theorems;Discrete & Computational Geometry;2023-05-12
3. Extendability of Simplicial Maps is Undecidable;Discrete & Computational Geometry;2022-11-29