Related papers: The Chromatic Splitting Conjecture at n=p=2

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…

In this paper, we present some properties on chromatic polynomials of hypergraphs which do not hold for chromatic polynomials of graphs. We first show that chromatic polynomials of hypergraphs have all integers as their zeros and contain…

We study the limit of the chromatic tower for not necessarily finite spectra, obtaining a generalization of the chromatic convergence theorem of Hopkins and Ravenel. Moreover, we prove that in general this limit does not coincide with…

Here we prove that for a 2K2-free graph G with maximum degree greater than or equal to 5, the chromatic number is less than or equal to max{maximum degree-1, maximum clique size}. This implies that Borodin & Kostochka Conjecture is true for…

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

Let $K = \mathbb{Q}(\sqrt{-q})$, where $q$ is any prime number congruent to $7$ modulo $8$, and let $\mathcal{O}$ be the ring of integers of $K$. The prime $2$ splits in $K$, say $2\mathcal{O} = \mathfrak{p} \mathfrak{p}^\ast$, and there is…

We develop a framework for displaying the stable homotopy theory of the sphere, at least after localization at the second Morava K-theory K(2). At the prime 3, we write the spectrum L_{K(2)S^0 as the inverse limit of a tower of fibrations…

In a seminal 1994 paper, Lusztig extended the theory of total positivity by introducing the totally non-negative part (G/P)_{\geq 0} of an arbitrary (generalized, partial) flag variety G/P. He referred to this space as a "remarkable…

Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…

A recent theorem by T. Barthel, M. Hausmann, N. Naumann, T. Nikolaus, J. Noel, and N. Stapleton says that if A is a finite abelian p-group of rank r, then any finite A-space X which is acyclic in the nth Morava K-theory with n at least r…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

A $(2+1)$-bispindle $B(k_1,k_2;k_3)$ is the union of two $xy$-dipaths of respective lengths $k_1$ and $k_2$, and one $yx$-dipath of length $k_3$, all these dipaths being pairwise internally disjoint. Recently, Cohen et al. conjectured that,…

Using the tools of algebraic Morse theory, and the thin poset approach to constructing homology theories, we give a categorification of Whitney's broken circuit theorem for the chromatic polynomial, and for Stanley's chromatic symmetric…

We study the coloring problem: Given a graph G, decide whether $c(G) \leq q$ or $c(G) \ge Q$, where c(G) is the chromatic number of G. We derive conditional hardness for this problem for any constant $3 \le q < Q$. For $q\ge 4$, our result…

We use Richter's $2$-primary proof of Gray's conjecture to give a homotopy decomposition of the fibre $\Omega^3S^{17}\{2\}$ of the $H$-space squaring map on the triple loop space of the $17$-sphere. This induces a splitting of the mod-$2$…

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation…

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…

We prove the height two case of a conjecture of Hovey and Strickland that provides a $K(n)$-local analogue of the Hopkins--Smith thick subcategory theorem. Our approach first reduces the general conjecture to a problem in arithmetic…

Let $G$ be a graph of order $n$ and $P(G,x)$ be the chromatic polynomial of $G$. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that $\frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0$ holds for all $k…