The following pages link to Martin Tancer (Q249463):
Displayed 50 items.
- A note on the colorful fractional Helly theorem (Q329541) (← links)
- Ramsey-type theorems for sets satisfying a geometric regularity condition (Q342924) (← links)
- Shellability of the higher pinched Veronese posets (Q472628) (← links)
- Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
- A counterexample to Wegner's conjecture on good covers (Q664352) (← links)
- A geometric proof of the colored Tverberg theorem (Q664361) (← links)
- Non-embeddability of geometric lattices and buildings (Q741603) (← links)
- Bounds for Pach's selection theorem and for the minimum solid angle in a simplex (Q745666) (← links)
- An engine breaking the \(\Omega\)EP-property (Q860497) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- The maximum piercing number for some classes of convex sets with the \((4,3)\)-property (Q1010733) (← links)
- Dimension gaps between representability and collapsibility (Q1042449) (← links)
- Note: Combinatorial Alexander duality -- a short and elementary proof (Q1042450) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result (Q1686405) (← links)
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) (Q1716008) (← links)
- Pach's selection theorem does not admit a topological extension (Q1991092) (← links)
- On the growth of the Möbius function of permutations (Q2010617) (← links)
- Barycentric cuts through a convex body (Q2105325) (← links)
- Helly-type results on support lines for disjoint families of unit disks (Q2292905) (← links)
- Untangling two systems of noncrossing curves (Q2630858) (← links)
- The unbearable hardness of unknotting (Q2656151) (← links)
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey (Q2847925) (← links)
- d-collapsibility is NP-complete for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi>d</mml:mi><mml:mo>⩾</mml:mo><mml:mn>4</mml:mn></mml:math> (Q2851437) (← links)
- Nerves of Good Covers Are Algorithmically Unrecognizable (Q2862208) (← links)
- A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane (Q2961538) (← links)
- $d$-representability of simplicial complexes of fixed dimension (Q2968081) (← links)
- (Q3132877) (← links)
- Embeddability in the 3-Sphere Is Decidable (Q3177893) (← links)
- Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings (Q3440271) (← links)
- Backbone Colorings and Generalized Mycielski Graphs (Q3563959) (← links)
- List-Coloring Squares of Sparse Subcubic Graphs (Q3614198) (← links)
- Bounding Helly Numbers via Betti Numbers (Q4604384) (← links)
- Embeddability in $\mathbb{R}^3$ is NP-hard (Q4607974) (← links)
- (Q4633898) (← links)
- Non-representability of finite projective planes by convex sets (Q4929997) (← links)
- Shellings and Sheddings Induced by Collapses (Q4959656) (← links)
- (Q5088981) (← links)
- On Betti numbers of flag complexes with forbidden induced subgraphs (Q5115548) (← links)
- (Q5115809) (← links)
- Embeddability in R <sup>3</sup> is NP-hard (Q5133975) (← links)
- Even maps, the Colin de Verdière number and representations of graphs (Q5146955) (← links)
- Shellability is NP-complete (Q5215450) (← links)
- Simplifying Inclusion–Exclusion Formulas (Q5364235) (← links)
- A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane (Q5367029) (← links)
- On Generalized Heawood Inequalities for Manifolds: a van Kampen--Flores-type Nonembeddability Result (Q5368707) (← links)
- Bounding Helly numbers via Betti numbers (Q5368709) (← links)
- d-collapsibility is NP-complete for d greater or equal to 4 (Q5414577) (← links)
- (Q5420021) (← links)