A combinatorial analog of a theorem of F.J. Dyson
From MaRDI portal
Publication:975232
DOI10.1016/J.TOPOL.2010.02.020zbMath1196.54073arXivmath/0608204OpenAlexW2014483825MaRDI QIDQ975232
Publication date: 9 June 2010
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0608204
Related Items (2)
On approximation of asymmetric separators of the \(n\)-cube ⋮ Algorithms for finding connected separators between antipodal points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On theorems of Borsuk-Ulam, Kakutani-Yamabe-Yujobô and Dyson. II
- A constructive proof of Tucker's combinatorial lemma
- Generalized Kneser coloring theorems with combinatorial proofs
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- A combinatorical proof of Kneser's conjecture
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- Continuous functions defined on spheres
- A generalization of Tucker's combinatorial lemma with topological applications
- On a theorem of F. J. Dyson
- Differential Topology
- 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
This page was built for publication: A combinatorial analog of a theorem of F.J. Dyson
