Exponentially many nowhere-zero Z3-, Z4-, and Z6-flows
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10369487" target="_blank" >RIV/00216208:11320/17:10369487 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.062" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.06.062</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.062" target="_blank" >10.1016/j.endm.2017.06.062</a>
Alternative languages
Result language
angličtina
Original language name
Exponentially many nowhere-zero Z3-, Z4-, and Z6-flows
Original language description
We prove that, in several settings, a graph has exponentially many nowhere-zero flows. Our results may be seen as a counting alternative to the well-known proofs of existence of $ZZ_3$-, $ZZ_4$-, and $ZZ_6$-flows. In the dual setting, proving exponential number of 3-colorings of planar triangle-free graphs is a related open question due to Thomassen.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Notes in Discrete Mathematics
ISSN
1571-0653
e-ISSN
—
Volume of the periodical
61
Issue of the periodical within the volume
August 2017
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
375-381
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85026759710