Note on long paths in Eulerian digraphs (Q2034059)
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 7361295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on long paths in Eulerian digraphs |
scientific article; zbMATH DE number 7361295 |
Statements
Note on long paths in Eulerian digraphs (English)
0 references
21 June 2021
0 references
Summary: Long paths and cycles in Eulerian digraphs have received a lot of attention recently. In this short note, we show how to use methods from [\textit{C. Knierim} et al., J. Comb. Theory, Ser. B 148, 125--148 (2021; Zbl 07318560)] to find paths of length \(d/(\log d+1)\) in Eulerian digraphs with average degree \(d\), improving the recent result of \(\Omega(d^{1/2+1/40})\). Our result is optimal up to at most a logarithmic factor.
0 references
minimum number of paths
0 references
Hajós conjecture
0 references
0 references
0.7743791341781616
0 references
0.7652801871299744
0 references
0.7620611786842346
0 references
0.7442120909690857
0 references
