On the minimal length of the longest trail in a fixed edge-density graph
Open Mathematics (2013)
- Volume: 11, Issue: 10, page 1831-1837
- ISSN: 2391-5455
Access Full Article
topAbstract
topHow to cite
topVajk Szécsi. "On the minimal length of the longest trail in a fixed edge-density graph." Open Mathematics 11.10 (2013): 1831-1837. <http://eudml.org/doc/269773>.
@article{VajkSzécsi2013,
	abstract = {A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).},
	author = {Vajk Szécsi},
	journal = {Open Mathematics},
	keywords = {Extremal graph theory; Paths; Trails; extremal graph theory; paths; trails},
	language = {eng},
	number = {10},
	pages = {1831-1837},
	title = {On the minimal length of the longest trail in a fixed edge-density graph},
	url = {http://eudml.org/doc/269773},
	volume = {11},
	year = {2013},
}
TY  - JOUR
AU  - Vajk Szécsi
TI  - On the minimal length of the longest trail in a fixed edge-density graph
JO  - Open Mathematics
PY  - 2013
VL  - 11
IS  - 10
SP  - 1831
EP  - 1837
AB  - A nearly sharp lower bound on the length of the longest trail in a graph on n vertices and average degree k is given provided the graph is dense enough (k ≥ 12.5).
LA  - eng
KW  - Extremal graph theory; Paths; Trails; extremal graph theory; paths; trails
UR  - http://eudml.org/doc/269773
ER  - 
References
top- [1] Catlin P.A., Super-Eulerian graphs: a survey, J. Graph Theory, 1992, 16(2), 177–196 http://dx.doi.org/10.1002/jgt.3190160209[Crossref]
- [2] Erdős P., Gallai T., On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar., 1959, 10(3–4), 337–356 http://dx.doi.org/10.1007/BF02024498[Crossref] Zbl0090.39401
- [3] Faudree R.J., Schelp R.H., Path connected graphs, Acta Math. Acad. Sci. Hungar., 1974, 25(3–4), 313–319 http://dx.doi.org/10.1007/BF01886090[Crossref] Zbl0294.05119
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.
 
 