AI Chat AI Image Generator AI Video Text to Speech

On Brooks' Theorem

08/03/2022
∙
by   Gopalan Sajith, et al.
∙
0
∙

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 10/10/2022

A Reunion of Godel, Tarski, Carnap, and Rosser

We unify Godel's First Incompleteness Theorem (1931), Tarski's Undefinab...
0 Saeed Salehi, et al. ∙
research
∙ 04/15/2023

Computer-assisted proofs of "Kariya's theorem" with computer algebra

We demonstrate computer-assisted proofs of "Kariya's theorem," a theorem...
0 Ayane Ito, et al. ∙
research
∙ 02/27/2018

Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables

This paper studies specifications and proofs of distributed algorithms w...
0 Saksham Chand, et al. ∙
research
∙ 03/05/2018

Learning how to Prove: From the Coq Proof Assistant to Textbook Style

We have developed an alternative approach to teaching computer science s...
0 Sebastian Böhne, et al. ∙
research
∙ 10/01/2019

Extraction of Efficient Programs in IΣ_1-arithmetic

Clausal Language (CL) is a declarative programming and verifying system ...
0 Ján Komara, et al. ∙
research
∙ 02/15/2022

A new discrete theory of pseudoconvexity

Recently geometric hypergraphs that can be defined by intersections of p...
0 Balázs Keszegh, et al. ∙
research
∙ 07/29/2021

Simple proofs of estimations of Ramsey numbers and of discrepancy

In this expository note we present simple proofs of the lower bound of R...
0 A. Buchaev, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal