Colorings of hypergraphs with large number of colors
نویسندگان
چکیده
The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n, r) denote the minimum possible number of edges in an n-uniform non-r-colorable hypergraph. We show that for r > n, c1 n lnn m(n, r) rn C1 n lnn, where c1, C1 > 0 are some absolute constants.
منابع مشابه
Problems and Results on Colorings of Mixed Hypergraphs
We survey results and open problems on ‘mixed hypergraphs’ that are hypergraphs with two types of edges. In a proper vertex coloring the edges of the first type must not be monochromatic, while the edges of the second type must not be completely multicolored. Though the first condition just means ‘classical’ hypergraph coloring, its combination with the second one causes rather unusual behavior...
متن کاملConflict-Free Colorings - Of Graphs and Hypergraphs - Diploma-Thesis of
Conflict-free colorings are known as vertex-colorings of hypergraphs. In such a coloring each hyperedge contains a vertex whose color is not assigned to any other vertex within this edge. In this thesis the notion of conflict-free colorings is translated to edge-colorings of graphs. For graphs G and H a conflict-free coloring of G ensures an edge of unique color in each copy of H in G. The mini...
متن کاملThe mixed hypergraphs
We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hy-pergraph using all colors, is called an upper chromatic number of a hypergraph H and denoted by ¯ χ(H). The general algorithm for computing the numbers of all colorings of mixed (containing edge and anti-edge se...
متن کاملInteger programming models for colorings of mixed hypergraphs
A mixed hypergraph H = (X, C,D) consists of the vertex set X and two families of subsets: the family C of C-edges and the family D of D-edges. In a coloring, every C-edge has at least two vertices of common color, while every D-edge has at least two vertices of different colors. The largest (smallest) number of colors for which a coloring of a mixed hypergraph H using all the colors exists is c...
متن کاملUnique colorings of bi-hypergraphs
We discuss the properties of uniform hypergraphs which have precisely one partition (i.e., a unique coloring apart from permutation of the colors) under the condition that in each edge, there exist three vertices which belong to precisely two classes of the partition. In particular, we investigate the relation between unique colorability, number of colors, and the cardinalities of color classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 2015