Chessboard and level sets of continuous functions
From MaRDI portal
Cites work
- A combinatorial analog of a theorem of F.J. Dyson
- A constructive proof of Tucker's combinatorial lemma
- A course in metric geometry
- A theorem on level lines of continuous functions
- Algorithms for finding connected separators between antipodal points
- An \(n\)-dimensional version of Steinhaus' chessboard theorem
- Defective and clustered graph colouring
- scientific article; zbMATH DE number 7227247 (Why is no real title available?)
- scientific article; zbMATH DE number 3654978 (Why is no real title available?)
- scientific article; zbMATH DE number 41767 (Why is no real title available?)
- scientific article; zbMATH DE number 1036702 (Why is no real title available?)
- scientific article; zbMATH DE number 1978378 (Why is no real title available?)
- scientific article; zbMATH DE number 1563693 (Why is no real title available?)
- scientific article; zbMATH DE number 1786790 (Why is no real title available?)
- On approximation of asymmetric separators of the n-cube
- On the connectedness of boundary and complement for domains
- The cube-like complexes and the Poincaré-Miranda theorem
- The Poincare-Miranda Theorem
- Un'osservazione su un teorema di Brouwer.
- 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: Chessboard and level sets of continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363885)