相关论文: Smaller counterexamples to Hedetniemi's conjecture

An equitable $k$-coloring of a graph is a proper $k$-coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connected graph $G$ has an equitable $k$-coloring for some $k\leq…

Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$. This far reaching generalization of K\"onig's theorem is only known to be true for $r\leq 3$,…

In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of $F$ in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits,…

A hamiltonian coloring $c$ of a graph $G$ of order $n$ is a mapping $c$ : $V(G) \rightarrow \{0,1,2,...\}$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$ $n-1$, for every two distinct vertices $u$ and $v$ of $G$, where $D(u, v)$ denotes the…

For any c >= 2, a c-strong coloring of the hypergraph G is an assignment of colors to the vertices of G such that for every edge e of G, the vertices of e are colored by at least min{c,|e|} distinct colors. The hypergraph G is…

For a graph $G$, the \emph{equitable chromatic number} of $G$, denoted by $\chi_e(G)$, is the smallest integer $k$ such that $G$ admits a proper $k$-coloring whose color classes differ in size by at most one. We prove that for every…

A vector $t$-coloring of a graph is an assignment of real vectors $p_1, \ldots, p_n$ to its vertices such that $p_i^Tp_i = t-1$ for all $i=1, \ldots, n$ and $p_i^Tp_j \le -1$ whenever $i$ and $j$ are adjacent. The vector chromatic number of…

We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red such that the blue subgraph has maximum degree at most 1 and…

We prove a better coloring theorem for aleph_4 and even aleph_3. This has a general topology consequence.

Let $\binom{X}{h}$ be the collection of all $h$-subsets of an $n$-set $X\supseteq Y$. Given a coloring (partition) of a set $S\subseteq \binom{X}{h}$, we are interested in finding conditions under which this coloring is extendible to a…

Given a graph $G$, a vertex-colouring $\sigma$ of $G$, and a subset $X\subseteq V(G)$, a colour $x \in \sigma(X)$ is said to be \emph{odd} for $X$ in $\sigma$ if it has an odd number of occurrences in $X$. We say that $\sigma$ is an…

The $c$-strong chromatic number of a hypergraph is the smallest number of colours needed to colour its vertices so that every edge sees at least $c$ colours or is rainbow. We show that every $t$-intersecting hypergraph has bounded $(t +…

Given a graph $H$, let $g(n,H)$ denote the smallest $k$ for which the following holds. We can assign a $k$-colouring $f_v$ of the edge set of $K_n$ to each vertex $v$ in $K_n$ with the property that for any copy $T$ of $H$ in $K_n$, there…

DeVos and Seymour (2003) proved that for every set $C$ of 3-colorings of a set $X$ of vertices, there exists a plane graph $G$ with vertices of $X$ incident with the outer face such that a 3-coloring of $X$ extends to a 3-coloring of $G$ if…

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…

Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

For a number $\ell\geq 2$, let $\mathcal{G}_{\ell}$ denote the family of graphs which have girth $2\ell+1$ and have no odd hole with length greater than $2\ell+1$. Plummer and Zha conjectured that every 3-connected and internally…

The famous List Colouring Conjecture from the 1970s states that for every graph $G$ the chromatic index of $G$ is equal to its list chromatic index. In 1996 in a seminal paper, Kahn proved that the List Colouring Conjecture holds…