相关论文: Hedetniemi's conjecture is asymptotically false

The chromatic number of $G\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.

A $50$ years unsolved conjecture by Hedetniemi [{\it Homomorphisms of graphs and automata, \newblock {\em Thesis (Ph.D.)--University of Michigan}, 1966}] asserts that the chromatic number of the categorical product of two graphs $G$ and $H$…

Hedetniemi conjectured in 1966 that $\chi(G \times H) = \min\{\chi(G), \chi(H)\}$ for all graphs $G$ and $H$. Here $G\times H$ is the graph with vertex set $ V(G)\times V(H)$ defined by putting $(x,y)$ and $(x',y')$ adjacent if and only if…

One of the most famous conjecture in graph theory is Hedetniemi's conjecture stating that the chromatic number of the categorical product of graphs is the minimum of their chromatic numbers. Using a suitable extension of the definition of…

For a graph $G$, let $\chi (G)$ denote the chromatic number. In graph theory, the following famous conjecture posed by Hedetniemi has been studied: For two graphs $G$ and $H$, $\chi (G\times H)=\min\{\chi (G),\chi (H)\}$, where $G \times H$…

Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta(G)\lfloor |V(H)|/2 \rfloor$. Chetwynd and Hilton in 1985 conjectured that a graph $G$ with $\Delta(G)>|V(G)|/3$ has chromatic…

Hedetniemi's conjecture~\cite{hedetniemi1966homomorphisms} for $c$-colorings states that the tensor product $G \times H$ is $c$-colorable if and only if $G$ or $H$ is $c$-colorable. El-Zahar and Sauer~\cite{El-ZaharS85} proved it for $c =…

It is proved that in Godel's constructible universe, for every infinite successor cardinal k, there exist graphs G and H of size and chromatic number k, for which the tensor product graph (G x H) is countably chromatic.

In 1966, Hedetniemi conjectured that for any positive integer $n$ and graphs $G$ and $H$, if neither $G$ nor $H$ is $n$-colourable, then $G \times H$ is not $n$-colourable. This conjecture has received significant attention over the past…

Hadwiger's conjecture asserts that every graph without a $K_t$-minor is $(t-1)$-colorable. It is known that the exact version of Hadwiger's conjecture does not extend to list coloring, but it has been conjectured by Kawarabayashi and Mohar…

We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…

Hadwiger's conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwiger's conjecture is true for line graphs. We investigate this conjecture on the closely related…

Ohba has conjectured \cite{ohb} that if the graph $G$ has $2\chi(G)+1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove that this conjecture is asymptotically correct. More…

The chromatic threshold delta_chi(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for which every H-free graph G with minimum degree at least d|G| satisfies chi(G)<C. We prove that delta_chi(H) \in {(r-3)/(r-2),…

A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph $F$, there is a constant $c_F > 0$ such that if $G$ is an $F$-free graph of maximum degree $\Delta$, then $\chi(G) \leq c_F \Delta / \log\Delta$. Alon, Krivelevich,…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

For a graph $G$, let $\chi(G)$ denote its chromatic number and $\sigma(G)$ denote the order of the largest clique subdivision in $G$. Let H(n) be the maximum of $\chi(G)/\sigma(G)$ over all $n$-vertex graphs $G$. A famous conjecture of…

We prove that for all $\varepsilon>0$, there exists a positive integer $n_0$ such that if $G$ is a graph on $n\geq n_0$ vertices with $\delta(G)\geq\tfrac{1}{2}(1 + \varepsilon)n$, then $G$ satisfies the Total Coloring Conjecture, that is,…

We prove that $\min\{\chi(G), \chi(H)\} - \chi(G\times H)$ can be arbitrarily large, and that if Stahl's conjecture on the multichromatic number of Kneser graphs holds, then $\min\{\chi(G), \chi(H)\}/\chi(G\times H) \leq 1/2 + \epsilon$ for…

Given a graphic degree sequence $D$, let $\chi(D)$ (respectively $\omega(D)$, $h(D)$, and $H(D)$) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique…