On the minimal length of the longest trail in a fixed edge-density graph

Bibliographic Details
Main Author: Szécsi Vajk
Format: Article
Language:English
Published: De Gruyter 2013-10-01
Series:Open Mathematics
Subjects:
Online Access:https://doi.org/10.2478/s11533-013-0285-x
id doaj-a324c9b85e71453cb5b52f545116692b
record_format Article
spelling doaj-a324c9b85e71453cb5b52f545116692b2021-09-06T19:22:53ZengDe GruyterOpen Mathematics2391-54552013-10-0111101831183710.2478/s11533-013-0285-xOn the minimal length of the longest trail in a fixed edge-density graphSzécsi Vajk0Department of Mathematics and its Applications, Central European University, Nádor u. 9, Budapest, 1051, Hungaryhttps://doi.org/10.2478/s11533-013-0285-x05c35extremal graph theorypathstrails
collection DOAJ
language English
format Article
sources DOAJ
author Szécsi Vajk
spellingShingle Szécsi Vajk
On the minimal length of the longest trail in a fixed edge-density graph
Open Mathematics
05c35
extremal graph theory
paths
trails
author_facet Szécsi Vajk
author_sort Szécsi Vajk
title On the minimal length of the longest trail in a fixed edge-density graph
title_short On the minimal length of the longest trail in a fixed edge-density graph
title_full On the minimal length of the longest trail in a fixed edge-density graph
title_fullStr On the minimal length of the longest trail in a fixed edge-density graph
title_full_unstemmed On the minimal length of the longest trail in a fixed edge-density graph
title_sort on the minimal length of the longest trail in a fixed edge-density graph
publisher De Gruyter
series Open Mathematics
issn 2391-5455
publishDate 2013-10-01
topic 05c35
extremal graph theory
paths
trails
url https://doi.org/10.2478/s11533-013-0285-x
work_keys_str_mv AT szecsivajk ontheminimallengthofthelongesttrailinafixededgedensitygraph
_version_ 1717770919956447232