Splitting necklaces and measurable colorings of the real line

DOI10.1090/S0002-9939-08-09699-8zbMath1229.05258arXiv1412.7996MaRDI QIDQ3625532

Noga Alon, Michał Lasoń, Jarosław Grytczuk, Mateusz Michałek

Publication date: 5 May 2009

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

splitting necklacesmeasurable coloring

Mathematics Subject Classification ID

Extremal set theory (05D05) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (3)

Anagram-Free Colourings of Graphs ⋮ A survey of mass partitions ⋮ Obstacles for splitting multidimensional necklaces

Cites Work

• Nonrepetitive colorings of graphs -- a survey
• Thue type problems for graphs, points, and numbers
• Splitting necklaces
• Avoidable patterns in strings of symbols
• Strongly non-repetitive sequences and progression-free sets
• Non-repetitive colorings of infinite sets
• Breaking the rhythm on graphs
• Bisection of Circle Colorings
• Open Problems in Pattern Avoidance
• Automatic Sequences
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• Nonrepetitive colorings of graphs
• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Splitting necklaces and measurable colorings of the real line