|Title:||Multiple chessboard complexes and the colored Tverberg problem||Journal:||Journal of Combinatorial Theory. Series A||Volume:||145||First page:||400||Last page:||425||Issue Date:||1-Jan-2017||Rank:||M21||ISSN:||0097-3165||DOI:||10.1016/j.jcta.2016.08.008||Abstract:||
Following Karaguezian, Reiner and Wachs we study the connectivity degree and shellability of multiple chessboard complexes. Our central new results provide sharp connectivity bounds relevant to applications in Tverberg type problems where multiple points of the same color are permitted. The results presented in this paper also serve as a foundation for the new results of Tverberg–van Kampen–Flores type, as described in the sequel to this paper.
|Keywords:||Multiple chessboard complexes | Shellable complexes | Tverberg theorem | van-Kampen–Flores theorem||Publisher:||Elsevier||Project:||Topology, geometry and global analysis on manifolds and discrete structures|
Show full item record
checked on Mar 19, 2023
checked on Mar 20, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.