Stability in the Erdős–Gallai Theorem on cycles and paths, II
Authors:
- Zoltán FürediZFZoltán Füredi
- Alexandr KostochkaAKAlexandr Kostochka
- Ruth LuoRLRuth Luo
- Jacques VerstraëteJVJacques Verstraëte
- 1 May 2018
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (5) , 1253-1263
Abstract
No abstract availableKeywords
Funding Information
- National Research, Development and Innovation Office NKFIH (K116769)
- Simons Foundation Collaboration grant (#317487)
- European Research Council Advanced Investigators Grant (267195)
- National Sleep Foundation (DMS-1266016)
- Russian Foundation for Basic Research (15-01-05867, 16-01-00499)
- National Sleep Foundation (DMS-1101489)
This publication has 7 references indexed in Scilit:
- Stability in the Erdős–Gallai Theorems on cycles and pathsJournal of Combinatorial Theory, Series B, 2016
- Long paths and large cycles in finite graphsJournal of Graph Theory, 1984
- Maximal circuits of graphs. IActa Mathematica Hungarica, 1976
- Path Ramsey numbers in multicoloringsJournal of Combinatorial Theory, Series B, 1975
- On maximal circuits in directed graphsJournal of Combinatorial Theory, Series B, 1975
- On Hamilton's idealsJournal of Combinatorial Theory, Series B, 1972
- On maximal paths and circuits of graphsActa Mathematica Hungarica, 1959