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

DOI10.2478/S11533-013-0285-XzbMATH Open1277.05089OpenAlexW1987333219MaRDI QIDQ386380FDOQ386380

Authors: Vajk Szécsi 

Publication date: 9 December 2013

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-013-0285-x

Recommendations

• Long monotone trails in random edge-labellings of random graphs
• Long cycles in subgraphs with prescribed minimum degree
• scientific article; zbMATH DE number 3885948
• Unavoidable cycle lengths in graphs
• On the Minimal Density of Triangles in Graphs

zbMATH Keywords

pathsextremal graph theorytrails

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Cites Work

• On maximal paths and circuits of graphs
• Supereulerian graphs: A survey
• Path connected graphs

Cited In (2)

• Ramsey numbers of trails and circuits
• Long monotone trails in random edge-labellings of random graphs

This page was built for publication: On the minimal length of the longest trail in a fixed edge-density graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386380)