scientific article
From MaRDI portal
Publication:3852213
zbMATH Open0419.05032MaRDI QIDQ3852213
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (54)
The Turán numbers of special forests ⋮ The Turán number of disjoint copies of paths ⋮ Extremal graphs for the distinguishing index ⋮ Extremal graphs of the \(p\)th power of paths ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ The maximum number of cliques in graphs without long cycles ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Turán numbers for disjoint paths ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ On Turán problems with bounded matching number ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Extremal Numbers for Odd Cycles ⋮ Stability in the Erdős-Gallai theorem on cycles and paths. II ⋮ Stability of extremal connected hypergraphs avoiding Berge-paths ⋮ Connected graphs without long paths ⋮ Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs ⋮ 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 ⋮ The spectral radius of graphs without paths and cycles of specified length ⋮ Maximizing the number of cliques in graphs with given matching number ⋮ 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 ⋮ Linear trees in uniform hypergraphs ⋮ Connected hypergraphs without long Berge-paths ⋮ Extremal graphs for the odd prism ⋮ A stability result of the Pósa lemma ⋮ Extremal graphs without long paths and large cliques ⋮ Exact results on generalized Erdős-Gallai problems ⋮ The Turán number of \(P_9 \cup P_7\) ⋮ A note on the stability results of the number of cliques in graphs with given matching number ⋮ On the Turán numbers of linear forests in bipartite graphs ⋮ A localized approach for Turán number of long cycles ⋮ On the Turán number of theta graphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ The Turán number of the square of a path ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ The Turań number of \(2P_7\) ⋮ Avoiding long Berge cycles ⋮ Planar Turán numbers on short cycles of consecutive lengths ⋮ Stability results on the circumference of a graph ⋮ On 2-connected hypergraphs with no long cycles ⋮ The structure of graphs with given lengths of cycles ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ Inverse Turán numbers ⋮ Extremal graphs for two vertex-disjoint copies of a clique ⋮ Multicolour Ramsey numbers of paths and even cycles
This page was built for publication:
