On the number of colored Birch and Tverberg partitions
zbMATH Open1300.05037arXiv1208.0509MaRDI QIDQ405313FDOQ405313
Authors: Stephan Hell
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.0509
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Partitions; congruences and congruential restrictions (11P83)
Cites Work
- 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
- A Generalization of Radon's Theorem
- Colourful simplicial depth
- \(3N\) colored points in a plane
- On the number of Birch partitions
- Note on a conjecture of Sierksma
- A Colored Version of Tverberg's Theorem
- Chessboard complexes indomitable
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- A geometric proof of the colored Tverberg theorem
- On the number of Tverberg partitions in the prime power case
Cited In (6)
This page was built for publication: On the number of colored Birch and Tverberg partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405313)