scientific article; zbMATH DE number 3652374

Cited in

(65)

The maximum number of cliques in graphs without long cycles
Stability in the Erdős-Gallai theorem on cycles and paths. II
Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
Maximizing the number of cliques in graphs with given matching number
Connected hypergraphs without long Berge-paths
On the Turán number of theta graphs
The Turán number of the square of a path
Planar Turán numbers on short cycles of consecutive lengths
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
The Turán numbers of special forests
Extremal graphs for the distinguishing index
Extremal graphs of the \(p\)th power of paths
The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
On \(r\)-uniform hypergraphs with circumference less than \(r\)
The Turań number of \(2P_7\)
Avoiding long Berge cycles
On 2-connected hypergraphs with no long cycles
Multicolour Ramsey numbers of paths and even cycles
The Turán number of disjoint copies of paths
Linear trees in uniform hypergraphs
Stability in the Erdős-Gallai theorems on cycles and paths
Extensions of the Erdős-Gallai theorem and Luo's theorem
Extremal numbers for odd 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}\)
How connectivity affects the extremal number of trees
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
Stability of extremal connected hypergraphs avoiding Berge-paths
On the Turán numbers of linear forests in bipartite graphs
Extremal graphs for the odd prism
Linear three-uniform hypergraphs with no Berge path of given length
A localized approach for Turán number of long cycles
The Turán number of vertex disjoint paths of lengths one and two
On generalized Turán number of graphs with bounded matching number
Stability in Bondy's theorem on paths and cycles
The number of edges in graphs with bounded clique number and circumference
Extremal graphs for star forests with bounded clique number
The Turán number of three disjoint paths
How connectivity affects the extremal number of trees (extended abstract)
3-uniform linear hypergraphs without a long Berge path (extended abstract)
Spectral extremal problems for graphs with bounded clique number
On the maximum size of connected hypergraphs without a path of given length
Many cliques in graphs with bounded matching number and circumference
On the multi-colored Ramsey numbers of paths and even cycles
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
Stability results on the circumference of a graph
Connected graphs without long paths
The spectral radius of graphs without paths and cycles of specified length

This page was built for publication:

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