Minimum Degrees for Powers of Paths and Cycles

DOI10.1137/20M1359183MaRDI QIDQ5048302

Eng Keat Hng

Publication date: 15 November 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.02210

zbMATH Keywords

pathscyclesminimum degreegraph power

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Tight cycles and regular slices in dense hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Panconnected graphs. II
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Forcing large tight components in 3-graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• The square of paths and cycles
• Hamiltonian square-paths
• Large planar subgraphs in dense graphs
• On Degree Sequences Forcing The Square of a Hamilton Cycle
• Filling the gap between Turán's theorem and Pósa's conjecture
• Embedding spanning subgraphs in uniformly dense and inseparable graphs
• Some Theorems on Abstract Graphs
• On the structure of linear graphs

This page was built for publication: Minimum Degrees for Powers of Paths and Cycles