Three-coloring triangle-free graphs on surfaces III. Graphs of girth five

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10416993" target="_blank" >RIV/00216208:11320/20:10416993 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/20:00116811
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=PIWoe3BZMX" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=PIWoe3BZMX</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2020.06.005" target="_blank" >10.1016/j.jctb.2020.06.005</a>

Result language
angličtina
Original language name
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five
Original language description
We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the description of the structure of 4-critical triangle-free graphs embedded in a fixed surface, presented in a future paper of this series. (C) 2020 Elsevier Inc. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)