A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10476623" target="_blank" >RIV/00216208:11320/23:10476623 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3DLSpLiXlz" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3DLSpLiXlz</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00493-023-00052-5" target="_blank" >10.1007/s00493-023-00052-5</a>
Alternative languages
Result language
angličtina
Original language name
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions
Original language description
The systematic study of Turan-type extremal problems for edge-ordered graphs was initiated by Gerbner et al. (Turan problems for Edge-ordered graphs, 2021). They conjectured that the extremal functions of edge-ordered forests of order chromatic number 2 are n(1+o(1)). Here we resolve this conjecture proving the stronger upper bound of n2(O(vlog n)). This represents a gap in the family of possible extremal functions as other forbidden edge-ordered graphs have extremal functions O(n(C)) for some c > 1. However, our result is probably not the last word: here we conjecture that the even stronger upper bound of n log(O(1)) n also holds for the same set of extremal functions.
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/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)
Others
Publication year
2023
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
Combinatorica
ISSN
0209-9683
e-ISSN
1439-6912
Volume of the periodical
43
Issue of the periodical within the volume
6
Country of publishing house
DE - GERMANY
Number of pages
13
Pages from-to
1111-1123
UT code for WoS article
001051214300001
EID of the result in the Scopus database
2-s2.0-85168348865