Revisiting a theorem by Folkman on graph colouring

Bonamy Marthe,Charbit Pierre,Defrain Oscar,Joret Gwenaël,Lagoutte Aurélie,Limouzy Vincent,Pastor Lucas,Sereni Jean-Sébastien

ELECTRONIC JOURNAL OF COMBINATORICS（2020）

引用 0|浏览28

暂无评分

摘要

We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of any graph is at most 2 plus the maximum over all subgraphs of the difference between the number of vertices and twice the independence number.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要