Triangle-free planar graphs with at most 64n(0.731 3)-colorings

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10448433" target="_blank" >RIV/00216208:11320/22:10448433 - isvavai.cz</a>

Result on the web

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=KTw6eS8lFZ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=KTw6eS8lFZ</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jctb.2022.05.003" target="_blank" >10.1016/j.jctb.2022.05.003</a>

Result language

angličtina

Original language name

Triangle-free planar graphs with at most 64n(0.731 3)-colorings

Original language description

Thomassen conjectured that triangle-free planar graphs have exponentially many 3-colorings. Recently, he disproved his conjecture by providing examples of such graphs with n vertices and at most 215n/ log2 n 3-colorings. We improve his construction, giving examples of such graphs with at most 64(nlog9/2 3) &lt; 64n(0.731 3)-colorings. We conjecture this exponent is optimal. (c) 2022 Elsevier Inc. All rights reserved.

Czech name

—

Czech description

—

Type

J_imp - 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

2022

Confidentiality

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

Name of the periodical

Journal of Combinatorial Theory. Series B

ISSN

0095-8956

e-ISSN

1096-0902

Volume of the periodical

156

Issue of the periodical within the volume

September

Country of publishing house

US - UNITED STATES

Number of pages

5

Pages from-to

294-298

UT code for WoS article

000807249300001

EID of the result in the Scopus database

2-s2.0-85130454316