Connected graphs without long paths

DOI10.1016/J.DISC.2007.08.047MaRDI QIDQ941391zbMATH OpenOpenAlexFDO

Authors Paul Balister, Ervin Győri, Jeno Lehel, R. H. Schelp

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

connected graphextremal graphpath

Mathematics Subject Classification ID

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

Recommendations

• On extremal graphs with no long paths
• Long path lemma concerning connectivity and independence number
• scientific article; zbMATH DE number 1775051
• On the maximum size of connected hypergraphs without a path of given length
• Long path connectivity of regular graphs

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• Graphs with large maximum degree containing no odd cycles of a given length
• On maximal paths and circuits of graphs
• Path Ramsey numbers in multicolorings

Cited in

(40)

• Inverse Turán numbers
• The spectral radius of graphs without paths and cycles of specified length
• The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs
• Extremal graphs of the \(p\)th power of paths
• Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
• Minimum degree of 3-graphs without long linear paths
• Graphs with few paths of prescribed length between any two vertices
• A note on maximum size of a graph without isolated vertices under the given matching number
• A Dirac-type theorem for uniform hypergraphs
• How connectivity affects the extremal number of trees
• Connected hypergraphs without long Berge-paths
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Extremal graphs without long paths and a given graph
• Connected Turán number of trees
• The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
• Maximum non-path-connected graphs
• Maxima of the \(Q\)-index: forbidden a Fan
• Turán numbers of multiple paths and equibipartite forests
• Graphs without dead ends
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Linear three-uniform hypergraphs with no Berge path of given length
• On the maximum size of connected hypergraphs without a path of given length
• The Turán numbers of special forests
• The Turań number of \(2P_7\)
• The Turán number of disjoint copies of paths
• Rainbow numbers for paths in planar graphs
• Graphs without spanning closed trails
• Turán numbers for disjoint paths
• Extremal graphs without long paths and large cliques
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number
• Planar Turán numbers of short paths
• The spectral radius of graphs without long cycles
• The Turán number of \(P_9 \cup P_7\)
• On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees
• On the Turán numbers of linear forests in bipartite graphs
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• Long path connectivity of regular graphs
• scientific article; zbMATH DE number 15461 (Why is no real title available?)
• On the multi-colored Ramsey numbers of paths and even cycles

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

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