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

From MaRDI portal
Revision as of 11:50, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5917516

zbMath1016.05001MaRDI QIDQ5917516

Ji{ří} Matoušek

Publication date: 20 May 2003

Published in: Universitext (Search for Journal in Brave)




Related Items (only showing first 100 items - show all)

An optimal algorithm for plane matchings in multipartite geometric graphsOn random subgraphs of Kneser and Schrijver graphsLovász' theorem on the chromatic number of spheres revisitedBox complexes, neighborhood complexes, and the chromatic numberTowards a noncommutative Brouwer fixed-point theoremA lower bound on the crossing number of uniform hypergraphsDichotomies, structure, and concentration in normed spacesIndependence numbers of random subgraphs of distance graphsA combinatorial proof for the circular chromatic number of Kneser graphsOn the number of Tverberg partitions in the prime power caseTopology and combinatorics of partitions of masses by hyperplanesGeneralizations of Tucker-Fan-Shashkin lemmasGeneralised Mycielski graphs, signature systems, and bounds on chromatic numbersOn expansion and topological overlapThe homology of the cycle matroid of a coned graphBier spheres and barycentric subdivisionGeneralized ham-sandwich cutsHom complexes and hypergraph coloringsUniform versions of index for uniform spaces with free involutionsNonpolytopal nonsimplicial lattice spheres with nonnegative toric \(g\)-vectorOn generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability resultPolynomial partitioning for several sets of varietiesDiameters of random distance graphsOn the number of colored Birch and Tverberg partitionsHardness of embedding simplicial complexes in \(\mathbb R^d\)A topological central point theoremCutting the same fraction of several measuresTverberg-type theorems for intersecting by raysThe hamburger theoremRelative \((p,\varepsilon )\)-approximations in geometryOptimal bounds for a colorful Tverberg-Vrećica type problemNew construction of graphs with high chromatic number and small clique numberSpheres arising from multicomplexesA stronger conclusion to the classical ham sandwich theoremAltermatic number of categorical product of graphsElementary abelian \({p}\)-groups are the only finite groups with the Borsuk-Ulam propertyPolynomial hierarchy, Betti numbers, and a real analogue of Toda's theoremA complex analogue of Toda's theoremNon-projectability of polytope skeletaRealization of subgraphs of random graphs by graphs of diameters in Euclidean spacesIsovariant maps from free \(C_n\)-manifolds to representation spheresCountable choice and compactnessLocal topology of the free complex of a two-dimensional generalized convex shellingExtreme amenability of \(L_0\), a Ramsey theorem, and Lévy groupsA counterexample to Wegner's conjecture on good coversReconstructing geometric objects from the measures of their intersections with test setsA slight improvement to the colored Bárány's theoremOn the chromatic number of general Kneser hypergraphsRandom Kneser graphs and hypergraphsAverage-value Tverberg partitions via finite Fourier analysisOn the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-spaceMultiple chessboard complexes and the colored Tverberg problemColorful subhypergraphs in uniform hypergraphsOn random subgraphs of Kneser graphs and their generalizationsTverberg plus minusMöbius coinvariants and bipartite edge-rooted forestsA new lower bound for the chromatic number of general Kneser hypergraphsEqual coefficients and tolerance in coloured Tverberg partitionsConvex geometry and waist inequalitiesTverberg's theorem with constraintsPositive-fraction intersection results and variations of weak epsilon-netsComputing solutions of the paintshop-necklace problemExtreme amenability of abelian \(L_0\) groupsProdsimplicial-neighborly polytopesThe chromatic number of almost stable Kneser hypergraphsAn elementary deduction of the topological Radon theorem from Borsuk-UlamSymmetries of the stable Kneser graphsChessboard complexes indomitableCombinatorics of unavoidable complexesA combinatorial analog of a theorem of F.J. DysonA tight colored Tverberg theorem for maps to manifoldsSymmetric multiple chessboard complexes and a new theorem of Tverberg typeOn topological relaxations of chromatic conjecturesConvex equipartitions via equivariant obstruction theorySimple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning techniqueOn the connectivity of visibility graphsPolytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cyclesA Tverberg type theorem for collectively unavoidable complexesRainbow polygons for colored point sets in the planeStrong independence and the dimension of a Tverberg setGeneralization of Kimberling's concept of triangle center for other polygonsA Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problemsTopological obstructions for vertex numbers of Minkowski sumsCombinatorial Stokes formulas via minimal resolutionsGeneral Bourgin-Yang theoremsOrthogonal equipartitionsOn the number of Birch partitionsCombinatorial groupoids, cubical complexes, and the Lovász ConjectureNoncommutative Borsuk-Ulam-type conjectures revisitedContinuous maps with the disjoint support propertyCovering dimension using toric varietiesNon-embeddability of geometric lattices and buildingsA note on the homotopy type of the Alexander dualOn the realization of subgraphs of a random graph by diameter graphs in Euclidean spacesBounds for Pach's selection theorem and for the minimum solid angle in a simplexGraph colorings, spaces of edges and spaces of circuitsPolitical structures and the topology of simplicial complexesEquilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini indexKakeya-Brascamp-Lieb inequalitiesIndependence 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