Greedy colorings of words
نویسندگان
چکیده
منابع مشابه
Greedy colorings of words
In the Binary Paint Shop Problem proposed by Epping et al. \cite{ephooe} one has to find a $0/1$-coloring of the letters of a word in which every letter from some alphabet appears twice, such that the two occurrences of each letter are colored differently and the total number of color changes is minimized. Meunier and Seb\H{o} \cite{mese} and Amini et al. \cite{armemimo} gave sufficient conditi...
متن کاملGreedy colorings of uniform hypergraphs
We give a very short proof of an Erdős conjecture that the number of edges in a non-2-colorable n-uniform hypergraph is at least f(n)2, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least c log n. With an ingenious recoloring idea he later proved that f(n) ≥ cn. Here we prove a weaker bound on f(n), namely f(n) ≥ cn. Instead of recoloring a r...
متن کاملTrees in greedy colorings of hypergraphs
It is a well-known proposition that every graph of chromatic number larger than t contains every tree with t edges. The ‘standard’ reasoning is that such a graph must contain a subgraph ofminimumdegree at least t . Bohman, Frieze, andMubayi noticed that, although this argument does not work for hypergraphs, it is still possible that the proposition holds for hypergraphs as well. Indeed, Loh rec...
متن کاملGreedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color changes. This problem is denoted by PPW(2, 1). This version and a more general version – with an arbitrary multiset of colors for each car – were proposed and studied for the first time in 2004 by Epping, Hochstättler and...
متن کاملFactor Colorings of Linearly Recurrent Words
In this short article, we study factor colorings of aperiodic linearly recurrent infinite words. We show that there always exists a coloring which does not admit a monochromatic factorization of the word into factors of increasing lengths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.03.038