Anagram-Free Colourings of Graphs

DOI10.1017/S096354831700027XzbMath1391.05111OpenAlexW2743768096MaRDI QIDQ3177364

Tomasz Łuczak, Nina Kamčev, Benjamin Sudakov

Publication date: 24 July 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354831700027x

zbMATH Keywords

anagram-chromatic number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

\(2\times n\) grids have unbounded anagram-free chromatic number ⋮ The Zero Forcing Number of Graphs ⋮ Avoiding abelian powers cyclically ⋮ Anagram-Free Colorings of Graph Subdivisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonrepetitive colorings of graphs -- a survey
• Thue type problems for graphs, points, and numbers
• The maximum number of perfect matchings in graphs with a given degree sequence
• Avoidable patterns in strings of symbols
• Strongly non-repetitive sequences and progression-free sets
• Combinatorial mathematics VIII. Proceedings of the Eighth Australian Conference on Combinatorial Mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980
• On the independence and chromatic numbers of random regular graphs
• Hamiltonicity thresholds in Achlioptas processes
• Splitting necklaces and measurable colorings of the real line
• Nonrepetitive colorings of graphs
• Abelian squares are avoidable on 4 letters
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• INFINITE PERIODIC GROUPS. I
• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?

This page was built for publication: Anagram-Free Colourings of Graphs