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

Kneser's 1955 conjecture -- proven by Lov\'asz in 1978 -- asserts that in any partition of the $k$-subsets of $\{1, 2, \dots, n\}$ into $n-2k-3$ parts, one part contains two disjoint sets. Schrijver showed that one can restrict to…

A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…

We show that if $E$ is a $p$-local Landweber exact homology theory of height $n$ and $p > n^2+n+1$, then there exists an equivalence $h \mathcal{S}p_{E} \simeq h\mathcal{D}(E_{*}E)$ between homotopy categories of $E$-local spectra and…

In this note, we give a brief overview of the telescope conjecture and the chromatic splitting conjecture in stable homotopy theory. In particular, we provide a proof of the folklore result that Ravenel's telescope conjecture for all…

At each prime $p$ and height $n+1 \ge 2$, we prove that the telescopic and chromatic localizations of spectra differ. Specifically, for $\mathbb{Z}$ acting by Adams operations on $\mathrm{BP}\langle n \rangle$, we prove that the…

We give a calculation of Picard groups of K(2)-local invertible spectra and of E(2)-local invertible spectra, both at the prime 3. The main contribution of this paper is to calculation the subgroup of invertible spectra with the same Morava…

The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…

We propose a way to organise the subject of ``higher-order homological stability'', in the context of a graded $E_2$-algebra $\mathbf{R}$, along the same lines that the chromatic perspective organises stable homotopy theory. From this point…

In this paper, we study the exotic $K(h)$-local Picard groups $\kappa_h$ when $2p-1=h^2$ and the homological Chromatic Vanishing Conjecture when $p-1$ does not divide $h$. The main idea is to use the Gross-Hopkins duality to relate both…

Let $\mathcal L_n$ for a positive integer $n$ denote the stable homotopy category of $v_n^{-1}BP$-local spectra at a prime number $p$. Then, M.~Hopkins defines the Picard group of $\mathcal L_n$ as a collection of isomorphism classes of…

Let $G$ be a simple graph with order $n$, maximum degree $\Delta(G)$, and chromatic index $\chi'(G)$, respectively. A graph $G$ is edge-chromatic critical if $\chi'(H)<\chi'(G)$ for every proper subgraph $H$ of $G$. Assume that $G$ is an…

We construct a connected graph H such that (1) \chi(H) = \omega; (2) K_\omega, the complete graph on \omega points, is not a minor of H. Therefore Hadwiger's conjecture does not hold for graphs with infinite coloring number.

The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We prove that for every graph $H$,…

In the early 1940's, P.A.Smith showed that if a finite p-group G acts on a finite complex X that is mod $p$ acyclic, then its space of fixed points, X^G, will also be mod p acyclic. In their recent study of the Balmer spectrum of…

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

By Lovasz' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z_2-space Hom(K_2,G) plus two. We show that the cohomological index of Hom(K_2,G) is also greater than the cohomological…

We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability…

We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2^{K^{1/3}} colors. This improves the previous result of K versus K^{O(log K)} in Khot [14].

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

We show that the n-th power of the first Stiefel-Whitney class of the Z_2-operation on the graph complex Hom(C_{2r+1},K_{n+2})$ is zero, confirming a conjecture by Babson and Kozlov. This proves the strong form of their graph colouring…