Related papers: A weak form of Hadwiger's conjecture

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ without cycles of length from $k+1$ to $f(k)$ admits a…

A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irregular subgraph of G. A colorable graph G is any graph which…

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 consider a natural graph operation $\Omega_k$ that is a certain inverse (formally: the right adjoint) to taking the k-th power of a graph. We show that it preserves the topology (the $\mathbb{Z}_2$-homotopy type) of the box complex, a…

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

We prove for k at most 10, that every graph of chromatic number k with a unique k-coloring admits a clique minor of order k.

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

A $K_3$-WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_3$-subgraph of $G$ get precisely two colors. We study graphs $G$ which admit at least one such coloring. We disprove…

The Hadwiger number $h(G)$ is the order of the largest complete minor in $G$. Does sufficient Hadwiger number imply a minor with additional properties? In [2], Geelen et al showed $h(G)\geq (1+o(1))ct\sqrt{\ln t}$ implies $G$ has a…

We study several cardinal, and ordinal--valued functions that are relatives of Hanf numbers. Let kappa be an infinite cardinal, and let T subseteq L_{kappa^+, omega} be a theory of cardinality <= kappa, and let gamma be an ordinal >=…

In this short note, we extend the result of Galluccio, Goddyn, and Hell, which states that graphs of large girth excluding a minor are nearly bipartite. We also prove a similar result for the oriented chromatic number, from which follows in…

The Kuratowski-Wagner Theorem asserts that a graph is planar if and only if it does not have either $K_{3,3}$ or $K_5$ as a minor. Using this Wagner obtained a precise description of all graphs with no $K_{3,3}$ minor and all graphs with no…

Let $G$, $H$ be groups and $\kappa$ be a cardinal. A bijection $f:G\to H$ is caled on asymorphism if, for any $X\in[G]^{<\kappa}$, $Y\in[H]^{<\kappa}$, there exist $X'\in[G]^{<\kappa}$, $Y'\in[H]^{<\kappa}$ such that for all $x\in G$ and…

We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) is compatible…

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

A complete structural characterization of graphs with no $K_{3,4}$ minor is obtained, and the following consequences are established. Every $4$-connected non-planar graph with at least seven vertices and minimum degree at least five…

Given a graph $G=(V,E)$ and a colouring $f:E\mapsto \mathbb N$, the induced colour of a vertex $v$ is the sum of the colours at the edges incident with $v$. If all the induced colours of vertices of $G$ are distinct, the colouring is called…

A $\textit{dominating $K_t$-model}$ in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leqslant i<j \leqslant t$ every vertex in $T_j$ has a neighbour in $T_i$.…

A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…