Antipaths in oriented graphs

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

Result language
angličtina
Original language name
Antipaths in oriented graphs
Original language description
We show that for any natural number k > 1, any oriented graph D of minimum semidegree at least (3k - 2)/4 contains an antidirected path of length k. In fact, a slightly weaker condition on the semidegree sequence of D suffices, and as a consequence, we confirm a weakened antidirected path version of a conjecture of Addario-Berry, Havet, Linhares Sales, Thomasse and Reed.& COPY; 2023 Elsevier B.V. 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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA22-19073S" target="_blank" >GA22-19073S: Combinatorial and computational complexity in topology and geometry</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)