Avoiding Multiple Repetitions in Euclidean Spaces

DOI10.1137/18M1180347zbMath1432.05115WikidataQ126418658 ScholiaQ126418658MaRDI QIDQ5208643

Przemysław Wenus, Urszula Pastwa, Jarosław Grytczuk, Michał Tuczyński, Krzysztof Węsek, Barbara Nayar, Michaĺ Deębski, Joanna Sokół

Publication date: 9 January 2020

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

zbMATH Keywords

pattern avoidanceLovász local lemmaEuclidean Ramsey theorynonrepetitive sequence

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Fractional meanings of nonrepetitiveness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonrepetitive colorings of line arrangements
• Nonrepetitive sequences on arithmetic progressions
• Grasshopper avoidance of patterns
• The origins of combinatorics on words
• Thue type problems for graphs, points, and numbers
• Multidimensional unrepetitive configurations
• Avoidable patterns in strings of symbols
• Euclidean Ramsey theorems. I
• Non-repetitive tilings
• Non-repetitive colorings of infinite sets
• The chromatic number of the plane is at least 5: a new proof
• Words avoiding repetitions in arithmetic progressions
• Breaking the rhythm on graphs
• Research Problems in Discrete Geometry
• Regularity and Positional Games
• Automatic Sequences
• The chromatic number of the plane is at least 5
• Computing Small Unit-Distance Graphs with Chromatic Number 5
• Nonrepetitive colorings of graphs
• THE EXISTENCE OF A PATTERN WHICH IS 5-AVOIDABLE BUT 4-UNAVOIDABLE
• On Sets of Distances of n Points
• Graph colouring and the probabilistic method
• Nonrepetitive and pattern-free colorings of the plane

This page was built for publication: Avoiding Multiple Repetitions in Euclidean Spaces