InforLorV4, Hal, Checkpoint, bibRecord, 000A70

Subcubic triangle-free graphs have fractional chromatic number at most $14/5$

Identifieur interne : 000A70 ( Hal/Checkpoint ); précédent : 000A69; suivant : 000A71

Subcubic triangle-free graphs have fractional chromatic number at most $14/5$

Auteurs : Zden K Dvo K [République tchèque] ; Jean-Sébastien Sereni [France] ; Jan Volec [Royaume-Uni]

Source :

Journal of the London Mathematical Society [ 0024-6107 ] ; 2014-06.

RBID : Hal:hal-00779634

English descriptors

mix :
- Fractional coloring, independent sets, weighted independent sets.

Abstract

We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233--237].

Url:

https://hal.archives-ouvertes.fr/hal-00779634

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: 004890
to stream Hal, to step Curation: 004890

Links to Exploration step

Hal:hal-00779634

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Subcubic triangle-free graphs have fractional chromatic number at most $14/5$</title>
<author><name sortKey="Dvo K, Zden K" sort="Dvo K, Zden K" uniqKey="Dvo K Z" first="Zden K" last="Dvo K">Zden K Dvo K</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-200866" status="VALID"><orgName>Computer Science Institute of Charles University [Prague]</orgName>
<orgName type="acronym">IUUK</orgName>
<desc><address><addrLine>Univerzita Karlova v Praze IUUK Malostranské nám. 25 118 00 Praha 1</addrLine>
<country key="CZ"></country>
</address>
<ref type="url">http://iuuk.mff.cuni.cz/</ref>
</desc>
<listRelation><relation active="#struct-349304" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-349304" type="direct"><org type="institution" xml:id="struct-349304" status="INCOMING"><orgName>Univerzita Karlova v Parze</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>République tchèque</country>
</affiliation>
</author>
<author><name sortKey="Sereni, Jean Sebastien" sort="Sereni, Jean Sebastien" uniqKey="Sereni J" first="Jean-Sébastien" last="Sereni">Jean-Sébastien Sereni</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205125" status="VALID"><idno type="RNSR">200818291B</idno>
<orgName>Knowledge  representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423086" type="direct"><org type="department" xml:id="struct-423086" status="VALID"><orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Volec, Jan" sort="Volec, Jan" uniqKey="Volec J" first="Jan" last="Volec">Jan Volec</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-117301" status="VALID"><orgName>Centre for Discrete Mathematics and its Applications [Warwick]</orgName>
<orgName type="acronym">DIMAP</orgName>
<desc><address><addrLine>University of Warwick Coventry CV4 7AL United Kingdom</addrLine>
<country key="GB"></country>
</address>
</desc>
<listRelation><relation active="#struct-302824" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-302824" type="direct"><org type="institution" xml:id="struct-302824" status="VALID"><orgName>University of Warwick [Coventry]</orgName>
<desc><address><addrLine>Coventry CV4 7AL</addrLine>
<country key="GB"></country>
</address>
<ref type="url">http://www2.warwick.ac.uk/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Royaume-Uni</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00779634</idno>
<idno type="halId">hal-00779634</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00779634</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00779634</idno>
<date when="2014-06">2014-06</date>
<idno type="wicri:Area/Hal/Corpus">004890</idno>
<idno type="wicri:Area/Hal/Curation">004890</idno>
<idno type="wicri:Area/Hal/Checkpoint">000A70</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000A70</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Subcubic triangle-free graphs have fractional chromatic number at most $14/5$</title>
<author><name sortKey="Dvo K, Zden K" sort="Dvo K, Zden K" uniqKey="Dvo K Z" first="Zden K" last="Dvo K">Zden K Dvo K</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-200866" status="VALID"><orgName>Computer Science Institute of Charles University [Prague]</orgName>
<orgName type="acronym">IUUK</orgName>
<desc><address><addrLine>Univerzita Karlova v Praze IUUK Malostranské nám. 25 118 00 Praha 1</addrLine>
<country key="CZ"></country>
</address>
<ref type="url">http://iuuk.mff.cuni.cz/</ref>
</desc>
<listRelation><relation active="#struct-349304" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-349304" type="direct"><org type="institution" xml:id="struct-349304" status="INCOMING"><orgName>Univerzita Karlova v Parze</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>République tchèque</country>
</affiliation>
</author>
<author><name sortKey="Sereni, Jean Sebastien" sort="Sereni, Jean Sebastien" uniqKey="Sereni J" first="Jean-Sébastien" last="Sereni">Jean-Sébastien Sereni</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-205125" status="VALID"><idno type="RNSR">200818291B</idno>
<orgName>Knowledge  representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation><relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423086" type="direct"><org type="department" xml:id="struct-423086" status="VALID"><orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Volec, Jan" sort="Volec, Jan" uniqKey="Volec J" first="Jan" last="Volec">Jan Volec</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-117301" status="VALID"><orgName>Centre for Discrete Mathematics and its Applications [Warwick]</orgName>
<orgName type="acronym">DIMAP</orgName>
<desc><address><addrLine>University of Warwick Coventry CV4 7AL United Kingdom</addrLine>
<country key="GB"></country>
</address>
</desc>
<listRelation><relation active="#struct-302824" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-302824" type="direct"><org type="institution" xml:id="struct-302824" status="VALID"><orgName>University of Warwick [Coventry]</orgName>
<desc><address><addrLine>Coventry CV4 7AL</addrLine>
<country key="GB"></country>
</address>
<ref type="url">http://www2.warwick.ac.uk/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Royaume-Uni</country>
</affiliation>
</author>
</analytic>
<series><title level="j">Journal of the London Mathematical Society</title>
<idno type="ISSN">0024-6107</idno>
<imprint><date type="datePub">2014-06</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Fractional coloring</term>
<term>independent sets</term>
<term>weighted independent sets</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233--237].</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Subcubic triangle-free graphs have fractional chromatic number at most $14/5$</title>
<author role="aut"><persName><forename type="first">Zdeněk</forename>
<surname>Dvořák</surname>
</persName>
<email></email>
<idno type="halauthor">539554</idno>
<affiliation ref="#struct-200866"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Jean-Sébastien</forename>
<surname>Sereni</surname>
</persName>
<email>Jean-Sebastien.Sereni@loria.fr</email>
<idno type="halauthor">808750</idno>
<affiliation ref="#struct-205125"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Jan</forename>
<surname>Volec</surname>
</persName>
<email></email>
<idno type="halauthor">653866</idno>
<affiliation ref="#struct-117301"></affiliation>
</author>
<editor role="depositor"><persName><forename>Jean-Sébastien</forename>
<surname>Sereni</surname>
</persName>
<email>sereni@kam.mff.cuni.cz</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1"><date type="whenSubmitted">2013-01-22 13:58:58</date>
</edition>
<edition n="v2"><date type="whenSubmitted">2013-05-28 09:33:37</date>
</edition>
<edition n="v3" type="current"><date type="whenSubmitted">2016-01-07 11:18:49</date>
<date type="whenWritten">2013-01</date>
<date type="whenModified">2016-01-09 01:07:16</date>
<date type="whenReleased">2016-01-08 16:01:37</date>
<date type="whenProduced">2014-06</date>
<date type="whenEndEmbargoed">2016-01-07</date>
<ref type="file" target="https://hal.archives-ouvertes.fr/hal-00779634v3/document"><date notBefore="2016-01-07"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.archives-ouvertes.fr/hal-00779634/file/dsv13.pdf"><date notBefore="2016-01-07"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="151838"><persName><forename>Jean-Sébastien</forename>
<surname>Sereni</surname>
</persName>
<email>sereni@kam.mff.cuni.cz</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00779634</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00779634</idno>
<idno type="halBibtex">dvoak:hal-00779634</idno>
<idno type="halRefHtml">Journal of the London Mathematical Society, London Mathematical Society, 2014, 89 (3), pp.641--662. <http://dx.doi.org/10.1112/jlms/jdt085></idno>
<idno type="halRef">Journal of the London Mathematical Society, London Mathematical Society, 2014, 89 (3), pp.641--662. <http://dx.doi.org/10.1112/jlms/jdt085></idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA-TALC" p="LORIA">Traitement automatique des langues et des connaissances</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA2">INRIA 2</idno>
</seriesStmt>
<notesStmt><note type="audience" n="1">Not set</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Subcubic triangle-free graphs have fractional chromatic number at most $14/5$</title>
<author role="aut"><persName><forename type="first">Zdeněk</forename>
<surname>Dvořák</surname>
</persName>
<idno type="halAuthorId">539554</idno>
<affiliation ref="#struct-200866"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Jean-Sébastien</forename>
<surname>Sereni</surname>
</persName>
<email>Jean-Sebastien.Sereni@loria.fr</email>
<idno type="halAuthorId">808750</idno>
<affiliation ref="#struct-205125"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Jan</forename>
<surname>Volec</surname>
</persName>
<idno type="halAuthorId">653866</idno>
<affiliation ref="#struct-117301"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="VALID">16371</idno>
<idno type="issn">0024-6107</idno>
<idno type="eissn">1469-7750</idno>
<title level="j">Journal of the London Mathematical Society</title>
<imprint><publisher>London Mathematical Society</publisher>
<biblScope unit="volume">89</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="pp">641--662</biblScope>
<date type="datePub">2014-06</date>
<date type="dateEpub">2014-01</date>
</imprint>
</monogr>
<ref type="publisher">http://dx.doi.org/10.1112/jlms/jdt085</ref>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Fractional coloring</term>
<term xml:lang="en">independent sets</term>
<term xml:lang="en">weighted independent sets</term>
</keywords>
<classCode scheme="classification">05C15; 05C72, 05C69</classCode>
<classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
<classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233--237].</abstract>
<particDesc><org type="consortium">LEA STRUCO</org>
</particDesc>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A70 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000A70 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Hal:hal-00779634
   |texte=   Subcubic triangle-free graphs have fractional chromatic number at most $14/5$
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Subcubic triangle-free graphs have fractional chromatic number at most $14/5$

Subcubic triangle-free graphs have fractional chromatic number at most $14/5$

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri