A characterization of edge-ordered graphs with almost linear extremal functions (Q6143933)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7794392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of edge-ordered graphs with almost linear extremal functions |
scientific article; zbMATH DE number 7794392 |
Statements
A characterization of edge-ordered graphs with almost linear extremal functions (English)
0 references
25 January 2024
0 references
Edge-ordered forest denotes an edge-ordered graph with a forest as its underlying simple graph. The authors prove that the extremal function of an edge-ordered graph is almost linear if and only if the graph is an edge-ordered forest of order chromatic number 2. An upper bound is established for the extremal functions of edge-ordered forests of order chromatic number 2.
0 references
extremal graph theory
0 references
Turán number
0 references
edge-ordered graphs
0 references
0.7989230751991272
0 references
0.7802212238311768
0 references
0.7780530452728271
0 references
0.777172327041626
0 references
