Revisiting a Theorem by Folkman on Graph Colouring

Revisiting a Theorem by Folkman on Graph Colouring

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Electronic journal of combinatorics 2020-03, Vol.27 (1)
Hauptverfasser: Bonamy, Marthe, Charbit, Pierre, Defrain, Oscar, Joret, Gwenaël, Lagoutte, Aurélie, Limouzy, Vincent, Pastor, Lucas, Sereni, Jean-Sébastien
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Mathematics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title The Electronic journal of combinatorics
container_volume 27
creator Bonamy, Marthe
Charbit, Pierre
Defrain, Oscar
Joret, Gwenaël
Lagoutte, Aurélie
Limouzy, Vincent
Pastor, Lucas
Sereni, Jean-Sébastien
description 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.
doi_str_mv 10.37236/8899
format Article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02194900v2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_02194900v2</sourcerecordid><originalsourceid>FETCH-LOGICAL-c219t-d487fb68acff1cd14501dc6efb4e6725887bb2a05add18ec3d107ac97290e66f3</originalsourceid><addsrcrecordid>eNpNkEtLw0AUhQdRsNb-h9m4cBG9M0nmsSzBtkJAkLoeJvMw0SRTZmqh_97Uiri6h8t37j0chBYEHnJOc_YohJQXaEaA80xIyi7_6Wt0k9IHAKFSljNEX92hS92-G9-xxtvWhegG3BzxKvSfgx5xGPE66l2Lq9CHrzhxt-jK6z65xe-co7fV07baZPXL-rla1pmhRO4zWwjuGya08Z4YS4oSiDXM-aZwjNNSCN40VEOprSXCmdxOGbWRnEpwjPl8ju7Pd1vdq13sBh2PKuhObZa1Ou1g-lNIgAOd2Lsza2JIKTr_ZyCgfkpRp1Lyb37VUgw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Revisiting a Theorem by Folkman on Graph Colouring</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Bonamy, Marthe ; Charbit, Pierre ; Defrain, Oscar ; Joret, Gwenaël ; Lagoutte, Aurélie ; Limouzy, Vincent ; Pastor, Lucas ; Sereni, Jean-Sébastien</creator><creatorcontrib>Bonamy, Marthe ; Charbit, Pierre ; Defrain, Oscar ; Joret, Gwenaël ; Lagoutte, Aurélie ; Limouzy, Vincent ; Pastor, Lucas ; Sereni, Jean-Sébastien</creatorcontrib><description>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.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/8899</identifier><language>eng</language><publisher>Open Journal Systems</publisher><subject>Combinatorics ; Mathematics</subject><ispartof>The Electronic journal of combinatorics, 2020-03, Vol.27 (1)</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0009-0009-9351-1099 ; 0000-0001-9203-1530 ; 0000-0001-7905-8018 ; 0000-0001-9401-040X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,864,885,27924,27925</link.rule.ids><backlink>$$Uhttps://hal.science/hal-02194900$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Bonamy, Marthe</creatorcontrib><creatorcontrib>Charbit, Pierre</creatorcontrib><creatorcontrib>Defrain, Oscar</creatorcontrib><creatorcontrib>Joret, Gwenaël</creatorcontrib><creatorcontrib>Lagoutte, Aurélie</creatorcontrib><creatorcontrib>Limouzy, Vincent</creatorcontrib><creatorcontrib>Pastor, Lucas</creatorcontrib><creatorcontrib>Sereni, Jean-Sébastien</creatorcontrib><title>Revisiting a Theorem by Folkman on Graph Colouring</title><title>The Electronic journal of combinatorics</title><description>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.</description><subject>Combinatorics</subject><subject>Mathematics</subject><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNpNkEtLw0AUhQdRsNb-h9m4cBG9M0nmsSzBtkJAkLoeJvMw0SRTZmqh_97Uiri6h8t37j0chBYEHnJOc_YohJQXaEaA80xIyi7_6Wt0k9IHAKFSljNEX92hS92-G9-xxtvWhegG3BzxKvSfgx5xGPE66l2Lq9CHrzhxt-jK6z65xe-co7fV07baZPXL-rla1pmhRO4zWwjuGya08Z4YS4oSiDXM-aZwjNNSCN40VEOprSXCmdxOGbWRnEpwjPl8ju7Pd1vdq13sBh2PKuhObZa1Ou1g-lNIgAOd2Lsza2JIKTr_ZyCgfkpRp1Lyb37VUgw</recordid><startdate>20200320</startdate><enddate>20200320</enddate><creator>Bonamy, Marthe</creator><creator>Charbit, Pierre</creator><creator>Defrain, Oscar</creator><creator>Joret, Gwenaël</creator><creator>Lagoutte, Aurélie</creator><creator>Limouzy, Vincent</creator><creator>Pastor, Lucas</creator><creator>Sereni, Jean-Sébastien</creator><general>Open Journal Systems</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0009-0009-9351-1099</orcidid><orcidid>https://orcid.org/0000-0001-9203-1530</orcidid><orcidid>https://orcid.org/0000-0001-7905-8018</orcidid><orcidid>https://orcid.org/0000-0001-9401-040X</orcidid></search><sort><creationdate>20200320</creationdate><title>Revisiting a Theorem by Folkman on Graph Colouring</title><author>Bonamy, Marthe ; Charbit, Pierre ; Defrain, Oscar ; Joret, Gwenaël ; Lagoutte, Aurélie ; Limouzy, Vincent ; Pastor, Lucas ; Sereni, Jean-Sébastien</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c219t-d487fb68acff1cd14501dc6efb4e6725887bb2a05add18ec3d107ac97290e66f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Combinatorics</topic><topic>Mathematics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bonamy, Marthe</creatorcontrib><creatorcontrib>Charbit, Pierre</creatorcontrib><creatorcontrib>Defrain, Oscar</creatorcontrib><creatorcontrib>Joret, Gwenaël</creatorcontrib><creatorcontrib>Lagoutte, Aurélie</creatorcontrib><creatorcontrib>Limouzy, Vincent</creatorcontrib><creatorcontrib>Pastor, Lucas</creatorcontrib><creatorcontrib>Sereni, Jean-Sébastien</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>The Electronic journal of combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bonamy, Marthe</au><au>Charbit, Pierre</au><au>Defrain, Oscar</au><au>Joret, Gwenaël</au><au>Lagoutte, Aurélie</au><au>Limouzy, Vincent</au><au>Pastor, Lucas</au><au>Sereni, Jean-Sébastien</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Revisiting a Theorem by Folkman on Graph Colouring</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2020-03-20</date><risdate>2020</risdate><volume>27</volume><issue>1</issue><issn>1077-8926</issn><eissn>1077-8926</eissn><abstract>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.</abstract><pub>Open Journal Systems</pub><doi>10.37236/8899</doi><orcidid>https://orcid.org/0009-0009-9351-1099</orcidid><orcidid>https://orcid.org/0000-0001-9203-1530</orcidid><orcidid>https://orcid.org/0000-0001-7905-8018</orcidid><orcidid>https://orcid.org/0000-0001-9401-040X</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1077-8926
ispartof The Electronic journal of combinatorics, 2020-03, Vol.27 (1)
issn 1077-8926
1077-8926
language eng
recordid cdi_hal_primary_oai_HAL_hal_02194900v2
source DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals
subjects Combinatorics
Mathematics
title Revisiting a Theorem by Folkman on Graph Colouring
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T22%3A20%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Revisiting%20a%20Theorem%20by%20Folkman%20on%20Graph%20Colouring&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Bonamy,%20Marthe&rft.date=2020-03-20&rft.volume=27&rft.issue=1&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/8899&rft_dat=%3Chal_cross%3Eoai_HAL_hal_02194900v2%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true