Related papers: Yet another proof of Brooks' theorem

We present a short and self-contained proof of the choosability version of Brooks' theorem.

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.

Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.

We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list…

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

We give a new simpler proof of a theorem of Jayne and Rogers.

We give a new proof of the existence of designs, which is much shorter and gives better bounds.

We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

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…

Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.

Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

We give a proof of Brooks' theorem and its list coloring extension using the algebraic method of Alon and Tarsi; this also shows that the Brooks' theorem remains valid in a more general game coloring setting.

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is computationally light and conceptually natural, and has the…

We present here a simple proof of Brown's diagonalizability theorem for certain elements of the algebra of a left regular band, including probability measures.