Fractional Coloring of Triangle-Free Planar Graphs

We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.

Saved in:
Bibliographic Details
Published in:The Electronic journal of combinatorics 2015-10, Vol.22 (4)
Main Authors: Dvořák, Zdeněk, Sereni, Jean-Sébastien, Volec, Jan
Format: Article
Language:English
Subjects:
Combinatorics
Mathematics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c255t-a4ec68bda7b567b201a5a445f0b86254e7bd78edf3670dede87d23704b0cc3123
cites
container_end_page
container_issue 4
container_start_page
container_title The Electronic journal of combinatorics
container_volume 22
creator Dvořák, Zdeněk
Sereni, Jean-Sébastien
Volec, Jan
description We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.
doi_str_mv 10.37236/4135
format article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00950493v2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_00950493v2</sourcerecordid><originalsourceid>FETCH-LOGICAL-c255t-a4ec68bda7b567b201a5a445f0b86254e7bd78edf3670dede87d23704b0cc3123</originalsourceid><addsrcrecordid>eNpNkE1Lw0AYhBdRsNb-h1w8eIi--50cSzCtENBDPS_vfqSNrEnZLYL_XmJFPM0wPDOHIWRF4YFrxtWjoFxekAUFrcuqZuryn78mNzm_A1BW13JBWJvQnYZpxFg0U5zSMO6LqS92acBxH0PZphCK14gjpmKT8HjIt-Sqx5jD6leX5K192jXbsnvZPDfrrnRMylOJIjhVWY_aSqUtA4oShZA92EoxKYK2XlfB91xp8MGHSnvGNQgLznHK-JLcn3cPGM0xDR-YvsyEg9muOzNnALUEUfPPmb07sy5NOafQ_xUomJ9TzHwK_wY4dFF4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fractional Coloring of Triangle-Free Planar Graphs</title><source>Freely Accessible Science Journals - check A-Z of ejournals</source><creator>Dvořák, Zdeněk ; Sereni, Jean-Sébastien ; Volec, Jan</creator><creatorcontrib>Dvořák, Zdeněk ; Sereni, Jean-Sébastien ; Volec, Jan</creatorcontrib><description>We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.</description><identifier>ISSN: 1077-8926</identifier><identifier>EISSN: 1077-8926</identifier><identifier>DOI: 10.37236/4135</identifier><language>eng</language><publisher>Open Journal Systems</publisher><subject>Combinatorics ; Mathematics</subject><ispartof>The Electronic journal of combinatorics, 2015-10, Vol.22 (4)</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><citedby>FETCH-LOGICAL-c255t-a4ec68bda7b567b201a5a445f0b86254e7bd78edf3670dede87d23704b0cc3123</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00950493$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Dvořák, Zdeněk</creatorcontrib><creatorcontrib>Sereni, Jean-Sébastien</creatorcontrib><creatorcontrib>Volec, Jan</creatorcontrib><title>Fractional Coloring of Triangle-Free Planar Graphs</title><title>The Electronic journal of combinatorics</title><description>We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.</description><subject>Combinatorics</subject><subject>Mathematics</subject><issn>1077-8926</issn><issn>1077-8926</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNpNkE1Lw0AYhBdRsNb-h1w8eIi--50cSzCtENBDPS_vfqSNrEnZLYL_XmJFPM0wPDOHIWRF4YFrxtWjoFxekAUFrcuqZuryn78mNzm_A1BW13JBWJvQnYZpxFg0U5zSMO6LqS92acBxH0PZphCK14gjpmKT8HjIt-Sqx5jD6leX5K192jXbsnvZPDfrrnRMylOJIjhVWY_aSqUtA4oShZA92EoxKYK2XlfB91xp8MGHSnvGNQgLznHK-JLcn3cPGM0xDR-YvsyEg9muOzNnALUEUfPPmb07sy5NOafQ_xUomJ9TzHwK_wY4dFF4</recordid><startdate>20151016</startdate><enddate>20151016</enddate><creator>Dvořák, Zdeněk</creator><creator>Sereni, Jean-Sébastien</creator><creator>Volec, Jan</creator><general>Open Journal Systems</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope></search><sort><creationdate>20151016</creationdate><title>Fractional Coloring of Triangle-Free Planar Graphs</title><author>Dvořák, Zdeněk ; Sereni, Jean-Sébastien ; Volec, Jan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c255t-a4ec68bda7b567b201a5a445f0b86254e7bd78edf3670dede87d23704b0cc3123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Combinatorics</topic><topic>Mathematics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dvořák, Zdeněk</creatorcontrib><creatorcontrib>Sereni, Jean-Sébastien</creatorcontrib><creatorcontrib>Volec, Jan</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>Dvořák, Zdeněk</au><au>Sereni, Jean-Sébastien</au><au>Volec, Jan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fractional Coloring of Triangle-Free Planar Graphs</atitle><jtitle>The Electronic journal of combinatorics</jtitle><date>2015-10-16</date><risdate>2015</risdate><volume>22</volume><issue>4</issue><issn>1077-8926</issn><eissn>1077-8926</eissn><abstract>We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.</abstract><pub>Open Journal Systems</pub><doi>10.37236/4135</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1077-8926
ispartof The Electronic journal of combinatorics, 2015-10, Vol.22 (4)
issn 1077-8926
1077-8926
language eng
recordid cdi_hal_primary_oai_HAL_hal_00950493v2
source Freely Accessible Science Journals - check A-Z of ejournals
subjects Combinatorics
Mathematics
title Fractional Coloring of Triangle-Free Planar Graphs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T08%3A22%3A24IST&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=Fractional%20Coloring%20of%20Triangle-Free%20Planar%20Graphs&rft.jtitle=The%20Electronic%20journal%20of%20combinatorics&rft.au=Dvo%C5%99%C3%A1k,%20Zden%C4%9Bk&rft.date=2015-10-16&rft.volume=22&rft.issue=4&rft.issn=1077-8926&rft.eissn=1077-8926&rft_id=info:doi/10.37236/4135&rft_dat=%3Chal_cross%3Eoai_HAL_hal_00950493v2%3C/hal_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c255t-a4ec68bda7b567b201a5a445f0b86254e7bd78edf3670dede87d23704b0cc3123%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true