A characterization of edge-ordered graphs with almost linear extremal functions (Q6143933): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00493-023-00052-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00493-023-00052-5 / rank | |||
Normal rank | |||
Latest revision as of 18:51, 30 December 2024
scientific article; zbMATH DE number 7794392
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
