Simplotopal maps and necklace splitting

DOI10.1016/j.disc.2014.01.008zbMath1283.05030OpenAlexW2076796791MaRDI QIDQ2439120

Frédéric Meunier

Publication date: 7 March 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal-enpc.archives-ouvertes.fr/hal-01792244/file/Simplotopal_Necklace_web.pdf

zbMATH Keywords

topological combinatoricscombinatorial proofnecklace splittingchain mapsimplotopes

Mathematics Subject Classification ID

Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

A survey of mass partitions ⋮ Fair splitting of colored paths ⋮ The classes PPA-\(k\): existence from arguments modulo \(k\) ⋮ The classes PPA-\(k\): existence from arguments modulo \(k\) ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich

Cites Work

• Unnamed Item
• Combinatorial Stokes formulas via minimal resolutions
• Splitting necklaces
• Generalizations of Baxter's theorem and cubical homology
• Generalized Kneser coloring theorems with combinatorial proofs
• Combinatorial necklace splitting
• The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
• Combinatorial properties of certain simplicial and cubical vertex maps
• Algorithmic construction of sets for k -restrictions
• Discrete Splittings of the Necklace
• Bisection of Circle Colorings
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• 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: Simplotopal maps and necklace splitting