Martin Tancer - publications

My research interests:

Geometrical and topological combinatorics, graph colorings

Research papers accepted for publication in refereed international journals

16. J. Matousek, M. Tancer, U. Wagner: A geometric proof of the colored Tverberg theorem, Discrete and Combinatorial Geometry. 47(2) (2012), 245-265. Preprint at Arxiv.
15. M. Tancer: A counterexample to Wegner's conjecture on good covers, Discrete and Combinatorial Geometry. 47(2) (2012), 266-274. Preprint at Arxiv.
14. M. Tancer: d-representability of simplicial complexes of fixed dimension, Journal of Computational Geometry, 2(1) (2011), 183-188. Link to the journal (open access).
13. M. Tancer: Strong d-collapsibility, Contributions to Discrete Mathematics, 6(2) (2011), 32-35. Link to the journal (open access).
12. J. Matousek, M. Tancer, U. Wagner: Hardness of embedding simplicial complexes in R^d, Journal of the European Mathematical Society, 13(2) (2011), 259-295. Preprint at Arxiv.
11. M. Tancer: d-collapsibility is NP-complete for d greater or equal to 4. Chicago Journal of Theoretical Computer Science, 2010, Preprint at Arxiv.
10. M. Tancer: Non-representability of finite projective planes by convex sets, Proceedings of the American Mathematical Society 138(9) (2010), 3285-3291. Preprint at Arxiv.
9. J. Miskuf, R. Skrekovski, M. Tancer: Backbone Colorings of Graphs with Bounded Degree, Discrete Applied Matheamtics 158(5) (2010), 534-542. Preprint in ITI series (unfortunately, the preprint contains some errors; use the journal version or email me for the recent version).
8. A. Bjorner, M. Tancer: Combinatorial Alexander Duality - a Short and Elementary Proof, Discrete and Computational Geometry 42(4) (2009), 586-593. Preprint at Arxiv.
7. J. Matousek, M. Tancer: Dimension Gaps Between Representability and Collapsibility, Discrete and Computational Geometry 42(4) (2009), 631-639. Preprint at Arxiv.
6. B. Luzar, R. Skrekovski, M. Tancer: Injective colorings of planar graphs with few colors, Discrete Mathematics 309(18) (2009), 5636-5649. Preprint in ITI series.
5. J. Miskuf, R. Skrekovski, M. Tancer: Backbone Colorings and Generalized Mycielski's Graphs, SIAM Journal on Discrete Mathematics 23 (2009), 1063-1070. Full version.
4. Z. Dvorak, R. Skrekovski, M. Tancer: List coloring squares of sparse subcubic graphs, SIAM Journal on Discrete Mathematics 22 (2008), 139-159. Preprint in ITI series.
3. J. Kyncl, M. Tancer: The maximum piercing number for some classes of convex sets with (4,3)-property, Electron. J. Combin. 15(1) (2008), R27. Link to the journal (open access).
2. J. Hladky, J. Novak, P. Pyrih, M. Sterzik, M. Tancer: An engine breaking ΩEP-property, Topology and its Applications 153(18) (2006), 3621-3626.
1. D. Kral, R. Skrekovski, M. Tancer: Construction of large graphs with no optimal surjective L(2,1)-labelings, SIAM Journal on Discrete Mathematics 20(2) (2006), 536-543. Preprint in ITI series.

Submitted papers

M. Tancer: Intersection patterns of convex sets via simplicial complexes, a survey, Preprint at Arxiv.

My PhD thesis

M. Tancer: Topological and geometrical combinatorics, Charles University in Prague. Download.