相关论文: Sperner's colorings of hypergraphs arising from ed…

For fixed positive integers $r, k$ and $\ell$ with $1 \leq \ell < r$ and an $r$-uniform hypergraph $H$, let $\kappa (H, k,\ell)$ denote the number of $k$-colorings of the set of hyperedges of $H$ for which any two hyperedges in the same…

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…

A harmonious coloring of a $k$-uniform hypergraph $H$ is a vertex coloring such that no two vertices in the same edge have the same color, and each $k$-element subset of colors appears on at most one edge. The harmonious number $h(H)$ is…

Fix an integer $k \ge 3$. A $k$-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant $c$ depending only on $k$ such that every simple $k$-uniform hypergraph $H$ with maximum degree $\D$…

The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…

A coloured version of classic extremal problems dates back to Erd\H{o}s and Rothschild, who in 1974 asked which $n$-vertex graph has the maximum number of 2-edge-colourings without monochromatic triangles. They conjectured that the answer…

We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree \Delta. (Proper in that no edge is mono-coloured and simple in that two edges have maximum…

We study the problem of constructing a (near) uniform random proper $q$-coloring of a simple $k$-uniform hypergraph with $n$ vertices and maximum degree $\Delta$. (Proper in that no edge is mono-colored and simple in that two edges have…

For graphs $G$ and $H$, an {\em $H$-colouring} of $G$ (or {\em homomorphism} from $G$ to $H$) is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colourings generalize such graph theory notions as…

We survey results concerning reconfigurations of colourings and dominating sets in graphs. The vertices of the $k$-colouring graph $\mathcal{C}_{k}(G)$ of a graph $G$ correspond to the proper $k$-colourings of a graph $G$, with two…

For a hypergraph $H$, let $q(H)$ denote the expected number of monochromatic edges when the color of each vertex in $H$ is sampled uniformly at random from the set of size 2. Let $s_{\min}(H)$ denote the minimum size of an edge in $H$.…

A complete $k$-coloring of a graph $G$ is a (not necessarily proper) $k$-coloring of the vertices of $G$, such that each pair of different colors appears in an edge. A complete $k$-coloring is also called connected, if each color class…

Let $H$ be a triple system with maximum degree $d>1$ and let $r>10^7\sqrt{d}\log^{2}d$. Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ in size by at most one. The bound on $r$ is sharp in order…

The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…

For graphs $G$ and $H$, an $H$-coloring of $G$ is a map from the vertices of $G$ to the vertices of $H$ that preserves edge adjacency. We consider the following extremal enumerative question: for a given $H$, which connected $n$-vertex…

Let $\sigma$ be a partition of the positive integer $r$. A $\sigma$-hypergraph $H=H(n,r,q|\sigma)$ is an $r$-uniform hypergraph on $nq$ vertices which are partitioned into $n$ classes $V_1, V_2, \ldots, V_n$ each containing $q$ vertices. An…

Inspired by earlier results about proper and polychromatic coloring of hypergraphs, we investigate such colorings of directed hypergraphs, that is, hypergraphs in which the vertices of each hyperedge is partitioned into two parts, a tail…

A $k$-uniform hypergraph is $s$-almost intersecting if every edge is disjoint from exactly $s$ other edges. Gerbner, Lemons, Palmer, Patk\'os and Sz\'ecsi conjectured that for every $k$, and $s>s_0(k)$, every $k$-uniform $s$-almost…

A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality)…

Cographs are exactly hereditarily well-colored graphs, i.e., the graphs for which a greedy coloring of every induced subgraph uses only the minimally necessary number of colors $\chi(G)$. In recent work on reciprocal best match graphs…