Related papers: A weak form of Hadwiger's conjecture
We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…
A connected $k$-chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. The only known double-critical $k$-chromatic graph is the complete $k$-graph $K_k$. The conjecture that there…
The \emph{choice number} of a graph $G$, denoted $\ch(G)$, is the minimum integer $k$ such that for any assignment of lists of size $k$ to the vertices of $G$, there is a proper colouring of $G$ such that every vertex is mapped to a colour…
Let B(kappa, lambda) be the subalgebra of P(kappa) generated by [kappa]^{<= lambda}. It is shown that if B is any homomorphic image of B(kappa, lambda) then either |B|< 2^lambda or |B|=|B|^lambda, moreover if X is the Stone space of B then…
We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…
A (minimal) transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. A coloring of a graph is a partition of its vertex set into anticliques, that is, sets of pairwise…
Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…
Given an uncountable regular cardinal $\kappa$, a partial order is $\kappa$-stationarily layered if the collection of regular suborders of $\mathbb{P}$ of cardinality less than $\kappa$ is stationary in $\mathcal{P}_\kappa(\mathbb{P})$. We…
A connected $k$-chromatic graph $G$ is said to be {\it double-critical} if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. A longstanding conjecture of Erd\H{o}s and Lov\'asz states that the complete graphs are the…
The Hadwiger number of a graph $G$, denoted $h(G)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h(G) \ge \chi(G)$, where $\chi(G)$ denotes…
Let $G$ be a graph with a vertex colouring $\alpha$. Let $a$ and $b$ be two colours. Then a connected component of the subgraph induced by those vertices coloured either $a$ or $b$ is known as a Kempe chain. A colouring of $G$ obtained from…
We give some existence/nonexistence statements on universal graphs, which under GCH give a necessary and sufficient condition for the existence of a universal graph of size lambda with no K(kappa), namely, if either kappa is finite or…
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…
Given d \in (0,infty) let k_d be the smallest integer k such that d < 2k\log k. We prove that the chromatic number of a random graph G(n,d/n) is either k_d or k_d+1 almost surely.
Extending a recent breakthrough of Shitov, we prove that the chromatic number of the tensor product of two graphs can be a constant factor smaller than the minimum chromatic number of the two graphs. More precisely, we prove that there…
A ccc-generically supercompact cardinal $\kappa$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $\kappa$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically…
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…
Contraction-critical graphs came from the study of minimal counterexamples to Hadwiger's conjecture. A graph is $k$-contraction-critical if it is $k$-chromatic, but any proper minor is $(k-1)$-colorable. It is a long-standing result of…
A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…
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.