The colored Tverberg's problem and complexes of injective functions

From MaRDI portal
Publication:1200006

DOI10.1016/0097-3165(92)90028-SzbMath0782.52003OpenAlexW2046487802WikidataQ114215149 ScholiaQ114215149MaRDI QIDQ1200006

Siniša T. Vrećica, Rade T. Živaljević

Publication date: 17 January 1993

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90028-s




Related Items

On the expected number of \(k\)-setsOn a conjecture of KarasevAlgorithms for ham-sandwich cutsShellability of chessboard complexesCounting triangle crossings and halving planesTolerance for colorful Tverberg partitionsGeneralized chessboard complexes and discrete Morse theoryDynamic half-space range reporting and its applicationsStabbing simplices by points and flatsCutting dense point sets in halfTopology and combinatorics of partitions of masses by hyperplanesA survey of mass partitionsTverberg plus constraintsThe coloured Tverberg theorem, extensions and new resultsTorsion in the matching complex and chessboard complexA Tverberg-type result on multicolored simplicesEnvy-free division via configuration spacesDomination numbers and homologyPerfect matching complexes of honeycomb graphsA simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theoremTheorems of Carathéodory, Helly, and Tverberg without dimensionColored Tverberg theorem with new constraints on the facesBeyond the Borsuk–Ulam Theorem: The Topological Tverberg StoryChromatic variants of the Erdős--Szekeres theorem on points in convex position.On levels in arrangements of surfaces in three dimensionsIntersection patterns of finite sets and of convex setsErdős-Szekeres-type statements: Ramsey function and decidability in dimension 1A geometric proof of the colored Tverberg theoremRegular polygonal partitions of a Tverberg typeUpper bounds for stabbing simplices by a lineMultiple chessboard complexes and the colored Tverberg problemFinite-to-one mapsA combinatorial property of points and balls, a colored versionEqual coefficients and tolerance in coloured Tverberg partitionsBarycenters of polytope skeleta and counterexamples to the topological Tverberg conjecture, via constraintsEquipartitions of measures in $\mathbb{R}^4$Chessboard complexes indomitableSymmetric multiple chessboard complexes and a new theorem of Tverberg typeMatching complexes, bounded degree graph complexes, and weight spaces of \(\mathrm{GL}_n\)-complexesTverberg’s theorem is 50 years old: A surveyThe clique operator on matching and chessboard graphsAn Improved Bound for k-Sets in Four DimensionsCycle-free chessboard complexes and symmetric homology of algebrasEppstein's bound on intersecting triangles revisitedA Tverberg type theorem for matroidsNote on a conjecture of SierksmaThe Tverberg-Vrećica problem and the combinatorial geometry on vector bundlesShelling Coxeter-like complexes and sorting on treesOn the Betti numbers of chessboard complexesMedian hyperplanes in normed spaces -- a surveyHigher matching complexes of complete graphs and complete bipartite graphsThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergNo‐dimension Tverberg's theorem and its corollaries in Banach spaces of type pMatching complexes of trees and applications of the matching tree algorithmCounterexamples to the colorful Tverberg conjecture for hyperplanesOptimal bounds for the colored Tverberg problemNo-dimensional Tverberg theorems and algorithmsEnvy-free division in the presence of a dragonHelly-type problems



Cites Work