Anagram-free colourings of graphs

DOI10.1017/S096354831700027XMaRDI QIDQ3177364zbMATH OpenOpenAlexFDO

Authors Nina Kamčev, Tomasz Łuczak, Benny 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)

Recommendations

• Anagram-free colorings of graphs
• Anagram-free graph colouring
• Anagram-Free Colorings of Graph Subdivisions
• Facial anagram-free edge-coloring of plane graphs
• \(2\times n\) grids have unbounded anagram-free chromatic number

Cites work

• scientific article; zbMATH DE number 3162927 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3296252 (Why is no real title available?)
• scientific article; zbMATH DE number 3375509 (Why is no real title available?)
• Abelian squares are avoidable on 4 letters
• Avoidable patterns in strings of symbols
• Combinatorial mathematics VIII. Proceedings of the Eighth Australian Conference on Combinatorial Mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980
• Hamiltonicity thresholds in Achlioptas processes
• INFINITE PERIODIC GROUPS. I
• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• On the independence and chromatic numbers of random regular graphs
• Splitting necklaces and measurable colorings of the real line
• Strongly non-repetitive sequences and progression-free sets
• The maximum number of perfect matchings in graphs with a given degree sequence
• Thue type problems for graphs, points, and numbers
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs

Cited in

(10)

• Anagram-free chromatic number is not pathwidth-bounded
• The Zero Forcing Number of Graphs
• Anagram-Free Colorings of Graph Subdivisions
• \(2\times n\) grids have unbounded anagram-free chromatic number
• Anagram-free colorings of graphs
• Anagram-free graph colouring
• Enumerative and structural aspects of anagrams without fixed letters
• Avoiding abelian powers cyclically
• On alternating anagrams
• Facial anagram-free edge-coloring of plane graphs

This page was built for publication: Anagram-free colourings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177364)