zbMath 1016.05001 MaRDI QID Q5917516
Ji{ří} Matoušek
Publication date : 20 May 2003
Published in : Universitext (Search for Journal in Brave )
An optimal algorithm for plane matchings in multipartite geometric graphs ⋮
On random subgraphs of Kneser and Schrijver graphs ⋮
Lovász' theorem on the chromatic number of spheres revisited ⋮
Box complexes, neighborhood complexes, and the chromatic number ⋮
Towards a noncommutative Brouwer fixed-point theorem ⋮
A lower bound on the crossing number of uniform hypergraphs ⋮
Dichotomies, structure, and concentration in normed spaces ⋮
Independence numbers of random subgraphs of distance graphs ⋮
A combinatorial proof for the circular chromatic number of Kneser graphs ⋮
On the number of Tverberg partitions in the prime power case ⋮
Topology and combinatorics of partitions of masses by hyperplanes ⋮
Generalizations of Tucker-Fan-Shashkin lemmas ⋮
Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers ⋮
On expansion and topological overlap ⋮
The homology of the cycle matroid of a coned graph ⋮
Bier spheres and barycentric subdivision ⋮
Generalized ham-sandwich cuts ⋮
Hom complexes and hypergraph colorings ⋮
Uniform versions of index for uniform spaces with free involutions ⋮
Nonpolytopal nonsimplicial lattice spheres with nonnegative toric \(g\)-vector ⋮
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result ⋮
Polynomial partitioning for several sets of varieties ⋮
Diameters of random distance graphs ⋮
On the number of colored Birch and Tverberg partitions ⋮
Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮
A topological central point theorem ⋮
Cutting the same fraction of several measures ⋮
Tverberg-type theorems for intersecting by rays ⋮
The hamburger theorem ⋮
Relative \((p,\varepsilon )\)-approximations in geometry ⋮
Optimal bounds for a colorful Tverberg-Vrećica type problem ⋮
New construction of graphs with high chromatic number and small clique number ⋮
Spheres arising from multicomplexes ⋮
A stronger conclusion to the classical ham sandwich theorem ⋮
Altermatic number of categorical product of graphs ⋮
Elementary abelian \({p}\)-groups are the only finite groups with the Borsuk-Ulam property ⋮
Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem ⋮
A complex analogue of Toda's theorem ⋮
Non-projectability of polytope skeleta ⋮
Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces ⋮
Isovariant maps from free \(C_n\)-manifolds to representation spheres ⋮
Countable choice and compactness ⋮
Local topology of the free complex of a two-dimensional generalized convex shelling ⋮
Extreme amenability of \(L_0\), a Ramsey theorem, and Lévy groups ⋮
A counterexample to Wegner's conjecture on good covers ⋮
Reconstructing geometric objects from the measures of their intersections with test sets ⋮
A slight improvement to the colored Bárány's theorem ⋮
On the chromatic number of general Kneser hypergraphs ⋮
Random Kneser graphs and hypergraphs ⋮
Average-value Tverberg partitions via finite Fourier analysis ⋮
On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮
Multiple chessboard complexes and the colored Tverberg problem ⋮
Colorful subhypergraphs in uniform hypergraphs ⋮
On random subgraphs of Kneser graphs and their generalizations ⋮
Tverberg plus minus ⋮
Möbius coinvariants and bipartite edge-rooted forests ⋮
A new lower bound for the chromatic number of general Kneser hypergraphs ⋮
Equal coefficients and tolerance in coloured Tverberg partitions ⋮
Convex geometry and waist inequalities ⋮
Tverberg's theorem with constraints ⋮
Positive-fraction intersection results and variations of weak epsilon-nets ⋮
Computing solutions of the paintshop-necklace problem ⋮
Extreme amenability of abelian \(L_0\) groups ⋮
Prodsimplicial-neighborly polytopes ⋮
The chromatic number of almost stable Kneser hypergraphs ⋮
An elementary deduction of the topological Radon theorem from Borsuk-Ulam ⋮
Symmetries of the stable Kneser graphs ⋮
Chessboard complexes indomitable ⋮
Combinatorics of unavoidable complexes ⋮
A combinatorial analog of a theorem of F.J. Dyson ⋮
A tight colored Tverberg theorem for maps to manifolds ⋮
Symmetric multiple chessboard complexes and a new theorem of Tverberg type ⋮
On topological relaxations of chromatic conjectures ⋮
Convex equipartitions via equivariant obstruction theory ⋮
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique ⋮
On the connectivity of visibility graphs ⋮
Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles ⋮
A Tverberg type theorem for collectively unavoidable complexes ⋮
Rainbow polygons for colored point sets in the plane ⋮
Strong independence and the dimension of a Tverberg set ⋮
Generalization of Kimberling's concept of triangle center for other polygons ⋮
A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems ⋮
Topological obstructions for vertex numbers of Minkowski sums ⋮
Combinatorial Stokes formulas via minimal resolutions ⋮
General Bourgin-Yang theorems ⋮
Orthogonal equipartitions ⋮
On the number of Birch partitions ⋮
Combinatorial groupoids, cubical complexes, and the Lovász Conjecture ⋮
Noncommutative Borsuk-Ulam-type conjectures revisited ⋮
Continuous maps with the disjoint support property ⋮
Covering dimension using toric varieties ⋮
Non-embeddability of geometric lattices and buildings ⋮
A note on the homotopy type of the Alexander dual ⋮
On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces ⋮
Bounds for Pach's selection theorem and for the minimum solid angle in a simplex ⋮
Graph colorings, spaces of edges and spaces of circuits ⋮
Political structures and the topology of simplicial complexes ⋮
Equilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini index ⋮
Kakeya-Brascamp-Lieb inequalities ⋮
Independence numbers and chromatic numbers of some distance graphs
This page was built for publication: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler