scientific article; zbMATH DE number 3262986

Cited in

(only showing first 100 items - show all)

An intersection theorem for four sets
The spectral radius of graphs with no odd wheels
Stability theorems for some Kruskal-Katona type results
Stability theorems for cancellative hypergraphs
A 2-stable family of triple systems
On a valence problem in extremal graph theory
The exact minimum number of triangles in graphs with given order and size
A note on stability for maximal \(F\)-free graphs
The maximum number of colorings of graphs of given order and size: a survey
A note on Turán numbers for even wheels
An Erdős-Gallai type theorem for vertex colored graphs
An extension of a fixed point problem for simple graphs
The extremal graph problem of the icosahedron
On the number of edges not covered by monochromatic copies of a fixed graph.
A hierarchy of randomness for graphs
The inducibility of oriented stars
Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
The Turán number of star forests
Some sharp results on the generalized Turán numbers
Some exact results for generalized Turán problems
Anti-Ramsey numbers of doubly edge-critical graphs
Extremal problems for the p-spectral radius of graphs
Some extremal problems for hereditary properties of graphs
Hypergraphs with many Kneser colorings
Some exact results of the generalized Turán numbers for paths
Spectral extremal graphs for edge blow-up of star forests
Excluding induced subgraphs. II: Extremal graphs
Mutual-visibility problems on graphs of diameter two
The maximum spectral radius of wheel-free graphs
A spectral Erdős-Rademacher theorem
Counting H-free orientations of graphs
Spectral extremal graphs for intersecting cliques
The Turán numbers of special forests
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
The Turań number of \(2P_7\)
The spectral radius of graphs with no intersecting odd cycles
Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
Combinatorial theorems in sparse random sets
The structure of almost all graphs in a hereditary property
On the independence numbers of the cubes of odd cycles
Sharp bounds for decomposing graphs into edges and triangles
0-1 matrices with zero trace whose squares are 0-1 matrices
Minimum \(H\)-decompositions of graphs: edge-critical case
Independent sets in hypergraphs
Turán's theorem inverted
Extremal graphs for two vertex-disjoint copies of a clique
Unit distances and diameters in Euclidean spaces
Hypergraph containers
Extremal graph for intersecting odd cycles
The Turán number of the graph 3P5
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
Stability results for two classes of hypergraphs
On the cycle space of a random graph
Extremal problems for directed graphs
A note on the Turán number of an arbitrary star forest
Counting substructures. I: Color critical graphs
Turán number of disjoint triangles in 4-partite graphs
The Turán number of \(k \cdot S_\ell \)
Some new results on the Turán number of star forests
An extremal graph problem
On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)
On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
Tight bounds for powers of Hamilton cycles in tournaments
Chromatic number via Turán number
Extremal graphs for odd wheels
The chromatic profile of locally colourable graphs
A unified approach to hypergraph stability
On the Turán number of forests
Turán numbers of bipartite graphs plus an odd cycle
Minimum rainbow \(H\)-decompositions of graphs
Turán numbers for disjoint copies of graphs
On the algebraic and topological structure of the set of Turán densities
On possible Turán densities
A linear hypergraph extension of Turán's theorem
Turán number and decomposition number of intersecting odd cycles
Loebl-Komlós-Sós conjecture: dense case
Generalized Turán results for edge blow-up of star forests
Generalized Turán problems for double stars
Paths are Turán-good
Two-regular subgraphs of hypergraphs
A stability theorem for maximal \(K_{r+1}\)-free graphs
Extremal digraphs avoiding an orientation of \(C_4\)
Ramsey numbers of a fixed odd-cycle and generalized books and fans
Star-critical Ramsey numbers for large generalized fans and books
Hypergraphs with minimum positive uniform Turán density
An extension of the rainbow Erdős-Rothschild problem
On Turán-good graphs
Edges not in any monochromatic copy of a fixed graph
Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
Edge-decompositions of graphs with high minimum degree
Strong Turán stability
Turán number of the odd-ballooning of complete bipartite graphs
An analytic approach to stability
On a generalized Erdős–Rademacher problem
Strong Turán stability
The fine structure of octahedron-free graphs
Every graph is eventually Turán-good
The Turán number for the edge blow-up of trees: the missing case
The Turán number for \(4 \cdot S_{\ell}^1\)

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 Q5548826)