Extremal graphs of the \(p\)th power of paths

DOI10.1016/j.ejc.2022.103548OpenAlexW4225016488MaRDI QIDQ2143414

Yanyan Li

Publication date: 31 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal graph for intersecting odd cycles
• Stability in the Erdős-Gallai theorems on cycles and paths
• Connected graphs without long paths
• The extremal graph problem of the icosahedron
• Extremal graphs for intersecting cliques
• Path Ramsey numbers in multicolorings
• Extremal graphs for intersecting triangles
• The Turán number of the square of a path
• The Turán number for the edge blow-up of trees
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Extremal graphs for blow-ups of keyrings
• Extremal graphs for edge blow-up of graphs
• On maximal paths and circuits of graphs
• Extremal graphs for the k‐flower

This page was built for publication: Extremal graphs of the \(p\)th power of paths