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
Borsuk-Ulam theoremcolored Tverberg theoremdeleted joinsexistence of equivariant mapsfixed pointsKneser conjecturenonembeddabilitysimplicial complexestest set paradigmTverberg's theoremVan Kampen-Flores theorem
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01) Helly-type theorems and geometric transversal theory (52A35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic topology (55-01) Fixed points and coincidences in algebraic topology (55M20) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Discriminantal varieties and configuration spaces in algebraic topology (55R80)
The ``Kneser conjecture -- posed by Martin Kneser in 1955 in the Jahresbericht der DMV -- is an innocent-looking problem about partitioning the \(k\)-subsets of an \(n\)-set into intersecting subfamilies. Its striking solution by \textit{L. Lovász} [J. Comb. Theory, Ser. A 25, 319-328 (1978; Zbl 0418.05028)] featured an unexpected use of the Borsuk-Ulam theorem [\textit{K. Borsuk}, Fundam. Math. 20, 177-190 (1933; Zbl 0006.42403)], that is, of a genuinely topological result about continuous antipodal maps of spheres. Matoušek's lively little textbook now shows that Lovász' insight as well as beautiful work of many others (such as Vrecića and Živaljević, and Sarkaria) have opened up an exciting area of mathematics that connects combinatorics, graph theory, algebraic topology and discrete geometry. What seemed like an ingenious trick in 1978 now presents itself as an instance of the ``test set paradigm: to construct configuration spaces for combinatorial problems such that coloring, incidence or transversal problems may be translated into the (non-)existence of suitable equivariant maps. The vivid account of this area and its ramifications by Matoušek is an exciting, a coherent account of this area of topological combinatorics. It features a collection of mathematical gems written with a broad view of the subject and still with loving care for details. Recommended reading! The reviewer is happy to acknowledge that he has contributed minor input to the writing of this book.
- scientific article; zbMATH DE number 863503
- A course in topological combinatorics
- scientific article; zbMATH DE number 3896984
- Kneser's conjecture, chromatic number, and homotopy
- scientific article; zbMATH DE number 2186841
- scientific article; zbMATH DE number 1069967
- Combinatorial algebraic topology
- scientific article; zbMATH DE number 2239243
- Colored topological Tverberg theorem of Blagojević, Matschke and Ziegler
- Zur Topologie der geschlossenen Kurven auf der Sphäre.
- Topological obstructions for vertex numbers of Minkowski sums
- Combinatorial Stokes formulas via minimal resolutions
- Orthogonal equipartitions
- On the number of Birch partitions
- Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
- Graph colorings, spaces of edges and spaces of circuits
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Dichotomies, structure, and concentration in normed spaces
- On expansion and topological overlap
- 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
- The hamburger theorem
- New construction of graphs with high chromatic number and small clique number
- Altermatic number of categorical product of graphs
- Elementary abelian \({p}\)-groups are the only finite groups with the Borsuk-Ulam property
- On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
- Möbius coinvariants and bipartite edge-rooted forests
- A new lower bound for the chromatic number of general Kneser hypergraphs
- Computing solutions of the paintshop-necklace problem
- Extreme amenability of abelian L₀ groups
- General Bourgin-Yang theorems
- Box complexes, neighborhood complexes, and the chromatic number
- Nonpolytopal nonsimplicial lattice spheres with nonnegative toric \(g\)-vector
- Cutting the same fraction of several measures
- Tverberg plus minus
- Combinatorics of unavoidable complexes
- Symmetric multiple chessboard complexes and a new theorem of Tverberg type
- Convex equipartitions via equivariant obstruction theory
- 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
- Noncommutative Borsuk-Ulam-type conjectures revisited
- Continuous maps with the disjoint support property
- Political structures and the topology of simplicial complexes
- Equilateral polygons in a Euclidean space and on deformed spheres via Fadell-Husseini index
- The intermediate value theorem and decision-making in psychology and economics: an expositional consolidation
- The Bestvina-Edwards theorem and the Hilbert-Smith conjecture
- Counterexamples to the colorful Tverberg conjecture for hyperplanes
- No-dimensional Tverberg theorems and algorithms
- Envy-free division in the presence of a dragon
- Borsuk-Ulam type theorems for \(G\)-spaces with applications to Tucker type lemmas
- On well-connected sets of strings
- Localization for hyperbolic measures on infinite-dimensional spaces
- Bisecting envelopes of convex polygons
- Existence of continuous maps from \(d\)-spheres \((d \geq 1)\) to its various triangulations having the disjoint support property
- Envy-free division of multi-layered cakes
- Sections and projections of nested convex bodies
- The Borsuk-Ulam theorem for planar polygon spaces
- The Borsuk-Ulam type theorems for finite-dimensional compact group actions
- Sharp bounds for the chromatic number of random Kneser graphs
- Bipartite complements of circle graphs
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
- Fair splittings by independent sets in sparse graphs
- Amalgamation and Ramsey properties of \(L_p\) spaces
- A generalization of Kneser graphs
- Plus minus analogues for affine Tverberg type results
- A glimpse into continuous combinatorics of posets, polytopes, and matroids
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
- Ham-sandwich cuts and center transversals in subspaces
- Creating semiflows on simplicial complexes from combinatorial vector fields
- An extension of a theorem of Yao and Yao
- Empty monochromatic simplices
- Extensions of Sperner and Tucker's lemma for manifolds
- Analogues of the central point theorem for families with \(d\)-intersection property in \(\mathbb R^d\)
- On threshold probability for the stability of independent sets in distance graphs
- Unavoidable complexes, via an elementary equivariant index theory
- Invariants in noncommutative dynamics
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
- Topology of geometric joins
- Characterization of extremal antipodal polygons
- Colouring quadrangulations of projective spaces
- On a topological relaxation of a conjecture of Erdős and Nešetřil
- Topology of acyclic complexes of tournaments and coloring
- Algorithmic solvability of the lifting-extension problem
- Strengthening topological colorful results for graphs
- On chromatic numbers of close-to-Kneser distance graphs
- Near equipartitions of colored point sets
- Bourgin-Yang versions of the Borsuk-Ulam theorem for \(p\)-toral groups
- Non-existence of certain type of convex functions on a Riemannian manifold with a pole
- Forbidden lifts (NP and CSP for combinatorialists)
- Splitting multidimensional necklaces
- Simplotopal maps and necklace splitting
- Helly numbers of acyclic families
- Colorful subgraphs in Kneser-like graphs
- Min-Max payoffs in a two-player location game
- Helly-type theorems for line transversals to disjoint unit balls
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- A note on interconnecting matchings in graphs
- Realizing RCC8 networks using convex regions
- A point in an \(nd\)-polytope is the barycenter of \(n\) points in its \(d\)-faces
- Homomorphisms of binary Cayley graphs
- WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
- Crossing patterns of semi-algebraic sets
- The topological Tverberg theorem and winding numbers
- A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917516)
