Related papers: Algebraic proof of Brooks' theorem
Given a graph $G$ and a list assignment $L$ for $G$, the indicated $L$-colouring game on $G$ is played by two players: Ann and Ben. In each round, Ann chooses an uncoloured vertex $v$, and Ben colours $v$ with a colour from $L(v)$ that is…
The Gr\"{o}tzsch Theorem states that every triangle-free planar graph admits a proper $3$-coloring. Among many of its generalizations, the one of Gr\"{u}nbaum and Aksenov, giving $3$-colorability of planar graphs with at most three…
As an application of the theory of Lawson homology and morphic cohomology, Walker proved that the Abel-Jacobi map factors through another regular homomorphism. In this note, we give a direct proof of the theorem.
We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider…
We prove a KKM-type theorem for matroid colored families of set coverings of a polytope. This generalizes Gale's colorful KKM theorem as well as recent sparse-colorful variants by Sober\'on, and McGinnis and Zerbib.
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
The Total Colouring Conjecture suggests that $\Delta+3$ colours ought to suffice in order to provide a proper total colouring of every graph $G$ with maximum degree $\Delta$. Thus far this has been confirmed up to an additive constant…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
We give a proof for the fundamental theorem of algebra,using the Fredholm index phenomena
We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…
We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.
We give a simple reformulation of the four color theorem as a problem on strings over a four letter alphabet.
First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be…
In this paper we prove the Bohr Theorem for slice regular functions. Following the historical path that led to the proof of the classical Bohr Theorem, we also extend the Borel-Carath\'eodory Theorem to the new setting.
We prove a uniformization theorem in complex algebraic geometry.
In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…
We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.
We make an attempt at proving the Four Colour Theorem in six pages.