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

A linearly ordered (LO) $k$-colouring of a hypergraph is a colouring of its vertices with colours $1, \dots, k$ such that each edge contains a unique maximal colour. Deciding whether an input hypergraph admits LO $k$-colouring with a fixed…

We show that, at the prime $p=2$, the spectrum $\Sigma^{-n}D(n)$ splits off the Madsen-Tillmann spectrum $MTO(n)=BO(n)^{-\gamma_n}$ which is compatible with the classic splitting of $M(n)$ off $BO(n)_+$. For $n=2$, together with our…

Let $S^{2n+1}\{p\}$ denote the homotopy fibre of the degree $p$ self map of $S^{2n+1}$. For primes $p \ge 5$, work of Selick shows that $S^{2n+1}\{p\}$ admits a nontrivial loop space decomposition if and only if $n=1$ or $p$.…

We prove the $K(n)$-local analogue of the Hahn-Wilson conjecture on fp-spectra, which states that the truncated Brown-Peterson spectra generate the category of fp-spectra as a thick subcategory. As a corollary, we deduce the original…

For a given graph $H$ and the graphical properties $P_1, P_2,\ldots,P_k$, a graph $H$ is said to be $(V_1, V_2,\ldots,V_k)$-partitionable if there exists a partition of $V(H)$ into $k$-sets $V_1, V_2\ldots,V_k$, such that for each…

A result of Gy\'arf\'as says that for every $3$-coloring of the edges of the complete graph $K_n$, there is a monochromatic component of order at least $\frac{n}{2}$, and this is best possible when $4$ divides $n$. Furthermore, for all…

Hoffman proved that for a simple graph $G$, the chromatic number $\chi(G)$ obeys $\chi(G) \le 1 - \frac{\lambda_1}{\lambda_{n}}$ where $\lambda_1$ and $\lambda_n$ are the maximal and minimal eigenvalues of the adjacency matrix of $G$…

Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $\Delta$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with…

Let $p$ be a prime number and $K$ a finite unramified extension of $\mathbb{Q}_p$. When $p$ is large enough with respect to $[K:\mathbb{Q}_p]$ and under mild genericity assumptions, we proved in our previous work that the admissible smooth…

Let $K$ be a finite extension of $\mathbb{Q}_p$ and $X$ a smooth proper $K$-variety with good reduction. Under a mild assumption on the behaviour of Hodge numbers under reduction modulo $p$, we prove that the existence of a non-zero global…

In this paper, using the well-known Karlsson-Minton formula, we mainly establish two divisibility results concerning truncated hypergeometric series. Let $n>2$ and $q>0$ be integers with $2\mid n$ or $2\nmid q$. We show that…

We compute the MU-based syntomic cohomologies, mod $(p,v_1,\cdots,v_{n+1})$, of all $\mathbb{E}_1$-MU-algebra forms of connective Morava K-theory k(n). As qualitative consequences, we deduce the Lichtenbaum--Quillen conjecture, telescope…

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no…

For any two non-negative integers h and k, h > k, an L(h, k)-colouring of a graph G is a colouring of vertices such that adjacent vertices admit colours that at least differ by h and vertices that are two distances apart admit colours that…

We give a negative answer to a question of Erdos and Hajnal: it is consistent that GCH holds and there is a colouring $c:[{\omega_2}]^2\to 2$ establishing $\omega_2 \not\to [(\omega_1;{\omega})]^2_2$ such that some colouring…

We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\'ark\"ozy: the vertex set of every $2$-edge-colored graph can be…

We show that there exist $k$-colorable matroids that are not $(b,c)$-decomposable when $b$ and $c$ are constants. A matroid is $(b,c)$-decomposable, if its ground set of elements can be partitioned into sets $X_1, X_2, \ldots, X_l$ with the…

We show that the zeroth coefficient of the cables of the HOMFLY polynomial (colored HOMFLY polynomials) does not distinguish mutants. This makes a sharp contrast with the total HOMFLY polynomial whose 3-cables can distinguish mutants.

Problem of finding an optimal upper bound for the chromatic no. of a graph is still open and very hard. Borodin and Kostochka Conjecture is still open and if proved will improve Brook bound on Chromatic no. of a graph. Here we prove Borodin…