Revisiting a theorem by Folkman on graph colouring

DOI10.37236/8899zbMath1435.05071arXiv1907.11429OpenAlexW3012210983MaRDI QIDQ2309226

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

Publication date: 30 March 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.11429

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• An upper bound on the Ramsey numbers R(3,k)
• Mangoes and blueberries
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• Hall ratio of the Mycielski graphs
• The fractional chromatic number of mycielski's graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• A Theorem on k-Saturated Graphs

This page was built for publication: Revisiting a theorem by Folkman on graph colouring