{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:51Z","timestamp":1753893831117,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.37236\/8899","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:18Z","timestamp":1584578658000},"source":"Crossref","is-referenced-by-count":0,"title":["Revisiting a Theorem by Folkman on Graph Colouring"],"prefix":"10.37236","volume":"27","author":[{"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Charbit","sequence":"additional","affiliation":[]},{"given":"Oscar","family":"Defrain","sequence":"additional","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]},{"given":"Aur\u00e9lie","family":"Lagoutte","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Limouzy","sequence":"additional","affiliation":[]},{"given":"Lucas","family":"Pastor","sequence":"additional","affiliation":[]},{"given":"Jean-S\u00e9bastien","family":"Sereni","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2020,3,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p56\/8044","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p56\/8044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:44:18Z","timestamp":1584578658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,20]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8899","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,3,20]]},"article-number":"P1.56"}}