论文信息 - Strong d-collapsibility - 字舞流文

Strong d-collapsibility

We introduce a notion of strong d-collapsibility. Using this notion, we simplify the proof of Matousek and the author showing that the nerve of a family of sets of size at most d is d-collapsible.

[1] Elias Gabriel Minian,et al. Strong Homotopy Types, Nerves and Collapses , 2009, Discret. Comput. Geom..

[2] Martin Tancer,et al. d-collapsibility is NP-complete for d greater or equal to 4 , 2008, Chic. J. Theor. Comput. Sci..

[3] Martin Tancer,et al. Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey , 2011, 1102.0417.

[4] J. Eckhoff. Helly, Radon, and Carathéodory Type Theorems , 1993 .

[5] G. Wegner,et al. d-Collapsing and nerves of families of convex sets , 1975 .

[6] Gil Kalai,et al. A topological colorful Helly theorem , 2005 .

[7] Jirí Matousek,et al. Dimension Gaps between Representability and Collapsibility , 2009, Discret. Comput. Geom..