Add to ORKGThe topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to R d, there are q disjoint faces Fi of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face Fi. A graph with the same vertex set as the simplex, and with two vertices adjacent if they should not be in the same Fi, is called a Tverberg graph if the topological Tverberg theorem still work. A consequence of our main theorem is that if the maximal degree of a graph is D, and D(D + 1) < q, then it is a Tverberg graph
In this work, we will use topological methods in combinatorics and geometry to present a proof of t...
Let r≥2 and d≥1 be integers, let N=(d+1)(r-1), and let ΔN denote a standard N-simplex. The Topologic...
International audienceI describe the history of Topological Tverberg Theorem. I present some importa...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(...
AbstractThe topological Tverberg theorem claims that for any continuous map of the (q−1)(d+1)-simple...
The topological Tverberg theorem has been generalized in several directions by setting extra restric...
AbstractFollowing a manuscript of K.S. Sarkaria we give an extensive account of the topological Tver...
This thesis on Topological Combinatorics contains 7 papers. All of them but paper B are published be...
Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such ...
AbstractWe prove that any continuous map of an N-dimensional simplex ΔN with colored vertices to a d...
We describe how a powerful new “constraint method” yields many different extensions of the topologic...
Tverberg’s theorem states that any set of (q-1)(d+1)+1 points in d-dimensional Euclidean space can b...
. Based on a manuscript of K. S. Sarkaria we give an extensive account of the topological Tverberg t...
We describe how a powerful new “constraint method” yields many different extensions of the topologi...
Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr ...
In this work, we will use topological methods in combinatorics and geometry to present a proof of t...
Let r≥2 and d≥1 be integers, let N=(d+1)(r-1), and let ΔN denote a standard N-simplex. The Topologic...
International audienceI describe the history of Topological Tverberg Theorem. I present some importa...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(...
AbstractThe topological Tverberg theorem claims that for any continuous map of the (q−1)(d+1)-simple...
The topological Tverberg theorem has been generalized in several directions by setting extra restric...
AbstractFollowing a manuscript of K.S. Sarkaria we give an extensive account of the topological Tver...
This thesis on Topological Combinatorics contains 7 papers. All of them but paper B are published be...
Tverberg-type theory aims to establish sufficient conditions for a simplicial complex $\Sigma$ such ...
AbstractWe prove that any continuous map of an N-dimensional simplex ΔN with colored vertices to a d...
We describe how a powerful new “constraint method” yields many different extensions of the topologic...
Tverberg’s theorem states that any set of (q-1)(d+1)+1 points in d-dimensional Euclidean space can b...
. Based on a manuscript of K. S. Sarkaria we give an extensive account of the topological Tverberg t...
We describe how a powerful new “constraint method” yields many different extensions of the topologi...
Denote by ∆N the N-dimensional simplex. A map f : ∆N → Rd is an almost r-embedding if fσ1∩. . .∩fσr ...
In this work, we will use topological methods in combinatorics and geometry to present a proof of t...
Let r≥2 and d≥1 be integers, let N=(d+1)(r-1), and let ΔN denote a standard N-simplex. The Topologic...
International audienceI describe the history of Topological Tverberg Theorem. I present some importa...