Connected graphs without long paths

DOI10.1016/J.DISC.2007.08.047zbMath1159.05029OpenAlexW2083899663MaRDI QIDQ941391

Richard H. Schelp, Jenő Lehel, Paul N. Balister, Ervin Gyoeri

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.047

zbMATH Keywords

pathconnected graphextremal graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Graphs with large maximum degree containing no odd cycles of a given length
• Path Ramsey numbers in multicolorings
• On maximal paths and circuits of graphs

Related Items (35)

The Turán numbers of special forests ⋮ The Turán number of disjoint copies of paths ⋮ Extremal graphs of the \(p\)th power of paths ⋮ Graphs without dead ends ⋮ On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees ⋮ Turán numbers for disjoint paths ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ A note on maximum size of a graph without isolated vertices under the given matching number ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \) ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ A Dirac-type theorem for uniform hypergraphs ⋮ The spectral radius of graphs without long cycles ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Linear three-uniform hypergraphs with no Berge path of given length ⋮ Rainbow numbers for paths in planar graphs ⋮ The spectral radius of graphs without paths and cycles of specified length ⋮ Unnamed Item ⋮ How connectivity affects the extremal number of trees ⋮ On the maximum size of connected hypergraphs without a path of given length ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ Connected hypergraphs without long Berge-paths ⋮ Extremal graphs without long paths and large cliques ⋮ The Turán number of \(P_9 \cup P_7\) ⋮ Connected Turán number of trees ⋮ The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs ⋮ On the Turán numbers of linear forests in bipartite graphs ⋮ The Turań number of \(2P_7\) ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ Minimum degree of 3-graphs without long linear paths ⋮ Planar Turán numbers of short paths ⋮ Maxima of the \(Q\)-index: forbidden a Fan ⋮ Inverse Turán numbers

This page was built for publication: Connected graphs without long paths