Related papers: Universal countably chromatic graph
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles in the plane does not.
We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that for every…
In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…
We produce a new, shorter construction of a minor-universal planar graph.
Recent results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's Theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komj\'ath, the…
We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands,…
We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…
Inspired by Owings's problem, we investigate whether, for a given an Abelian group $G$ and cardinal numbers $\kappa,\theta$, every colouring $c:G\longrightarrow\theta$ yields a subset $X\subseteq G$ with $|X|=\kappa$ such that $X+X$ is…
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…
For an uncountable regular cardinal \kappa we let \nabla_\kappa(A) be the statement that A \subset \kappa and for all regular \theta > \kappa, the set of all X \in [\theta]^<\kappa such that X \cap \kappa \in \kappa and otp(X \cap OR) is a…
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles in Euclidean plane has countable chromatic number, while there is no Vitali set.
An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…
Let Gn be the graph on n-dimensional Euclidean space connecting points of rational Euclidean distance. It is consistent relative to an inaccessible cardinal that ZF+DC holds and G3 has countable chromatic number, yet G4 has uncountable…
We prove that, for every function $f:\mathbb{N} \rightarrow \mathbb{N}$, there is a graph $G$ with uncountable chromatic number such that, for every $k \in \mathbb{N}$ with $k \geq 3$, every subgraph of $G$ with fewer than $f(k)$ vertices…
We show that all sufficiently nice $\lambda$-sets are countable dense homogeneous ($\mathsf{CDH}$). From this fact we conclude that for every uncountable cardinal $\kappa \le \mathfrak{b}$ there is a countable dense homogeneous metric space…
It is well-known that the consistency strength of the GCH failing at a measurable cardinal is the existence of a cardinal $\kappa$ with $o(\kappa)=\kappa^{++}$. As the literature does not contain more than a proof sketch of the lower bound…
An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a…
For each infinite cardinal k, the set of algebraic hypergraphs having chromatic number no larger than k is decidable.