相关论文: The Chromatic Splitting Conjecture at n=p=2

A conjecture of Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy says that in every $2$-coloring of the edges of the complete $k$-uniform hypergraph $K_n^k$, there are two disjoint monochromatic loose paths of distinct colors such that they cover all…

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

Inspired by the Ax--Kochen isomorphism theorem, we develop a notion of categorical ultraproducts to capture the generic behavior of an infinite collection of mathematical objects. We employ this theory to give an asymptotic solution to the…

Hill, Hopkins, and Ravenel suggest that the last remaining Kervaire invariant problem, the case of $p=3$, can be solved by computing the homotopy fixed points spectral sequence for $\pi_* E_6^{hC_9}$. We prove a detection theorem for this…

Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $C$ such that there exists a proper edge-coloring of the complete graph $K_{n}$ with $C$ colors containing no $k$ vertex-disjoint color…

A connected graph $G$ with chromatic number $t$ is double-critical if $G \backslash \{x, y\}$ is $(t - 2)$-colorable for each edge $xy \in E(G)$. The complete graphs are the only known examples of double-critical graphs. A long-standing…

In a previous paper, the author (together with Matthew Emerton) proved that the completed cohomology groups of SL_N(Z) are stable in fixed degree as N goes to infinity (Z may be replaced by the ring O_F of integers of any number field). In…

Let $p_k(n)$ denote the number of $2$-color partitions of $n$ where one of the colors appears only in parts that are multiples of $k$. We will prove a conjecture of Ahmed, Baruah, and Dastidar on congruences modulo $5$ for $p_k(n)$.…

Using a Milnor-Moore argument we show that, $K(2)$-locally at the prime $2$, the spectra $MU\langle 6\rangle$ and $MString$ split as direct sums of Morava $E$-theories after tensoring with a finite Galois extension of the sphere called…

In the way of proving Kneser's conjecture, L\'{a}szl\'{o} Lov\'{a}sz settled out a new lower bound for the chromatic number. He showed that if neighborhood complex $\mathcal{N}(G)$ of a graph $G$ is topologically $k$-connected, then its…

The NP-complete problems Colouring and k-Colouring $(k\geq 3$) are well studied on $H$-free graphs, i.e., graphs that do not contain some fixed graph $H$ as an induced subgraph. We research to what extent the known polynomial-time…

We show that the map from $K({\mathbb S})$ to its chromatic completion is a connective cover and identify the fiber in $K$-theoretic terms. We combine this with recent work of Land-Mathew-Meier-Tamme to prove a form of "Waldhausen's…

The chromatic polynomial of a graph G counts the number of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the coefficients of the chromatic polynomial form a…

This paper contains a complete computation of the homotopy ring of the spectrum of topological modular forms constructed by Hopkins and Miller. The computation is done away from 6, and at the (interesting) primes 2 and 3 separately, and in…

A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a $P_5$-free graph with clique number $\omega\ge 3$ has chromatic number at most $\omega^{\log_2(\omega)}$. The best previous result was an exponential upper…

We study the triangulated subcategories of compact objects in stable homotopy categories such as the homotopy category of spectra, the derived categories of rings, and the stable module categories of Hopf algebras. In the first part of this…

Following a suggestion of Hovey and Strickland, we study the category of $K(k) \vee K(k+1) \vee \cdots \vee K(n)$-local spectra. When $k = 0$, this is equivalent to the category of $E(n)$-local spectra, while for $k = n$, this is the…

Given a graphic degree sequence $D$, let $\chi(D)$ (respectively $\omega(D)$, $h(D)$, and $H(D)$) denote the maximum value of the chromatic number (respectively, the size of the largest clique, largest clique subdivision, and largest clique…

We present a phenomenological theory of scalar particles that transform as a sextet and an octet of QCD interactions. These particles may arise as light bound states of a fundamental dynamics giving rise to a composite Higgs boson and…

Hadwiger's Conjecture asserts that every $K_h$-minor-free graph is properly $(h-1)$-colourable. We prove the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with…