Planar graphs without cycles of length 4 or 5 are (11:3)-colorable

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10401427" target="_blank" >RIV/00216208:11320/19:10401427 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=XRGxgmumYe" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=XRGxgmumYe</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2019.07.007" target="_blank" >10.1016/j.ejc.2019.07.007</a>

Result language
angličtina
Original language name
Planar graphs without cycles of length 4 or 5 are (11:3)-colorable
Original language description
A graph G is (a : b)-colorable if there exists an assignment of b-element subsets of {1, ... , a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is (11 : 3)-colorable, a weakening of recently disproved Steinberg's conjecture. In particular, each such graph with n vertices has an independent set of size at least 3/11 n. (C) 2019 Elsevier Ltd. 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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)