相关论文: The square of the 9-hypercube is 14-colorable

Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in…

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that $D(u,v)+|c(u)-c(v)|\geq p-1$ for every two distinct vertices u and v of G, where D(u,v) denoted the detour distance between u and v.…

For $1\leq s_1 \le s_2 \le \ldots \le s_k$ and a graph $G$, a packing $(s_1, s_2, \ldots, s_k)$-coloring of $G$ is a partition of $V(G)$ into sets $V_1, V_2, \ldots, V_k$ such that, for each $1\leq i \leq k$, the distance between any two…

Let $G$ be an edge-colored graph with $n$ vertices. A subgraph $H$ of $G$ is called a rainbow subgraph of $G$ if the colors of each pair of the edges in $E(H)$ are distinct. We define the minimum color degree of $G$ to be the smallest…

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…

The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is monochromatic. We show that every graph of maximum degree…

Let $G$ be an edge-coloured graph. The minimum colour degree $\delta^c(G)$ of $G$ is the largest integer $k$ such that, for every vertex $v$, there are at least $k$ distinct colours on edges incident to $v$. We say that $G$ is properly…

For $q,n,d \in \mathbb{N}$, let $A_q(n,d)$ be the maximum size of a code $C \subseteq [q]^n$ with minimum distance at least $d$. We give a divisibility argument resulting in the new upper bounds $A_5(8,6) \leq 65$, $A_4(11,8)\leq 60$ and…

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

We construct an edge-coloring of $K_{N}$ (for $N = 3432$) in colors red, dark blue, and light blue, such that there are no monochromatic blue triangles and such that the coloring satisfies a certain strong universal-existential property.…

Let $H$ be a $k$-uniform hypergraph with $n$ vertices. A {\em strong $r$-coloring} is a partition of the vertices into $r$ parts, such that each edge of $H$ intersects each part. A strong $r$-coloring is called {\em equitable} if the size…

It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The equitable chromatic number of a graph $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of…

The $q$-color Ramsey number of a $k$-uniform hypergraph $H$ is the minimum integer $N$ such that any $q$-coloring of the complete $k$-uniform hypergraph on $N$ vertices contains a monochromatic copy of $H$. The study of these numbers is one…

Let $H$ be a hypergraph. For a $k$-edge coloring $c : E(H) \to \{1,...,k\}$ let $f(H,c)$ be the number of components in the subhypergraph induced by the color class with the least number of components. Let $f_k(H)$ be the maximum possible…

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…