Fair splitting of colored paths

zbMath1369.05157arXiv1704.02921MaRDI QIDQ2401427

Meysam Alishahi, Frédéric Meunier

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.02921

zbMATH Keywords

independent setsnecklace splittingoctahedral Tucker lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Fair representation in the intersection of two matroids ⋮ Fair splittings by independent sets in sparse graphs ⋮ The structural complexity landscape of finding balance-fair shortest paths ⋮ SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ The complexity of finding fair independent sets in cycles

Cites Work

• Splitting necklaces
• Generalized Kneser coloring theorems with combinatorial proofs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A combinatorical proof of Kneser's conjecture
• Combinatorial necklace splitting
• Simplotopal maps and necklace splitting
• Algorithmic construction of sets for k -restrictions
• Fair Representation by Independent Sets

This page was built for publication: Fair splitting of colored paths