
arXiv: 1402.5331
We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-3/(3n+1)$.
planar graph, Fractional graph theory, fuzzy graph theory, fractional colouring, planar graphs, Planar graphs; geometric and topological aspects of graph theory, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics - Combinatorics, Primary: 05C15, Secondary: 05C10, 05C72, Combinatorics (math.CO)
planar graph, Fractional graph theory, fuzzy graph theory, fractional colouring, planar graphs, Planar graphs; geometric and topological aspects of graph theory, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics - Combinatorics, Primary: 05C15, Secondary: 05C10, 05C72, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
