3-Flows with large support
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10423618" target="_blank" >RIV/00216208:11320/20:10423618 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=I5HKGInYsQ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=I5HKGInYsQ</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2019.12.006" target="_blank" >10.1016/j.jctb.2019.12.006</a>
Alternative languages
Result language
angličtina
Original language name
3-Flows with large support
Original language description
We prove that every 3-edge-connected graph G has a 3-flow phi with the property that |supp(phi)| >= 5/6 |E(G)|. The graph K_4 demonstrates that this 5/6 ratio is best possible; there is an infinite family where 5/6 is tight.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA19-21082S" target="_blank" >GA19-21082S: Graphs and their algebraic properties</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
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
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
144
Issue of the periodical within the volume
6 February 2020
Country of publishing house
US - UNITED STATES
Number of pages
49
Pages from-to
32-80
UT code for WoS article
000543403800003
EID of the result in the Scopus database
2-s2.0-85078918960