Four proofs of the directed Brooks' Theorem

09/03/2021
by   Pierre Aboulker, et al.
0

We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

A Reunion of Godel, Tarski, Carnap, and Rosser

We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinab...
research
09/11/2022

PPP-Completeness and Extremal Combinatorics

Many classical theorems in combinatorics establish the emergence of subs...
research
09/19/2022

A Generalized Argmax Theorem with Applications

The argmax theorem is a useful result for deriving the limiting distribu...
research
06/09/2018

Functional Pearl: Theorem Proving for All (Equational Reasoning in Liquid Haskell)

Equational reasoning is one of the key features of pure functional langu...
research
07/06/2022

Gacs-Kucera Theorem

Gacs-Kucera Theorem, tightened by Barmpalias and Lewis-Pye, w.t.t.-reduc...
research
05/02/2022

A Critique of Uribe's "P vs. NP"

In this critique, we examine the technical report by Daniel Uribe entitl...
research
08/11/2022

Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev

We discuss the use of negative bases in automatic sequences. Recently th...

Please sign up or login with your details

Forgot password? Click here to reset