The following pages link to Connected graphs without long paths (Q941391):
Displaying 25 items.
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles (Q668084) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- On the multi-colored Ramsey numbers of paths and even cycles (Q727052) (← links)
- Minimum degree of 3-graphs without long linear paths (Q776262) (← links)
- The spectral radius of graphs without paths and cycles of specified length (Q962114) (← links)
- The spectral radius of graphs without long cycles (Q1736228) (← links)
- Connected hypergraphs without long Berge-paths (Q2033897) (← links)
- Maxima of the \(Q\)-index: forbidden a Fan (Q2111921) (← links)
- Inverse Turán numbers (Q2113336) (← links)
- The Turán numbers of special forests (Q2127719) (← links)
- Extremal graphs of the \(p\)th power of paths (Q2143414) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- Rainbow numbers for paths in planar graphs (Q2242061) (← links)
- The Turań number of \(2P_7\) (Q2312054) (← links)
- Planar Turán numbers of short paths (Q2334068) (← links)
- The Turán number of disjoint copies of paths (Q2374168) (← links)
- On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees (Q2675869) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- Turán numbers for disjoint paths (Q6056755) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- A note on maximum size of a graph without isolated vertices under the given matching number (Q6095058) (← links)
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
- Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \) (Q6184551) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
