scientific article; zbMATH DE number 3262986
From MaRDI portal
Publication:5548826
zbMATH Open0164.24604MaRDI QIDQ5548826FDOQ5548826
Authors: Miklós Simonovits 
Publication date: 1968
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Stability theorems for some Kruskal-Katona type results
- A note on stability for maximal \(F\)-free graphs
- The maximum number of colorings of graphs of given order and size: a survey
- An extension of a fixed point problem for simple graphs
- The extremal graph problem of the icosahedron
- Anti-Ramsey numbers of doubly edge-critical graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- 0-1 matrices with zero trace whose squares are 0-1 matrices
- The Turán number of the graph 3P5
- Stability results for two classes of hypergraphs
- On the cycle space of a random graph
- Extremal graphs for odd wheels
- Tight bounds for powers of Hamilton cycles in tournaments
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
- Chromatic number via Turán number
- A unified approach to hypergraph stability
- Extremal digraphs avoiding an orientation of \(C_4\)
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- Star-critical Ramsey numbers for large generalized fans and books
- A stability theorem for maximal \(K_{r+1}\)-free graphs
- Strong Turán stability
- Edges not in any monochromatic copy of a fixed graph
- Ramsey Numbers Involving Large Books
- Additive approximation for edge-deletion problems
- Generalized Turán problems for disjoint copies of graphs
- A coloring problem for intersecting vector spaces
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- On the Turán number of theta graphs
- On a conjecture of spectral extremal problems
- The typical structure of sparse \(K_{r+1}\)-free graphs
- On graphs \(G\) for which all large trees are \(G\)-good
- Turán numbers of extensions
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- Dense flag triangulations of 3-manifolds via extremal graph theory
- Strong forms of stability from flag algebra calculations
- Structure and stability of triangle-free set systems
- Books in graphs
- Ramsey numbers of fans and large books
- Some extremal results on complete degenerate hypergraphs
- The Turán number of disjoint copies of paths
- Star-critical Ramsey numbers of generalized fans
- Tight bounds on the coefficients of partition functions via stability
- Tight bounds on the coefficients of partition functions via stability
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- The minimum number of triangles in graphs of given order and size
- Star-critical Ramsey numbers involving large books
- Geometric stability via information theory
- Turán numbers for odd wheels
- Stability results for graphs with a critical edge
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Measures on monotone properties of graphs
- Forbidding induced even cycles in a graph: typical structure and counting
- A rainbow Erdös-Rothschild problem
- Disjoint unions of complete minors
- Monotone maps, sphericity and bounded second eigenvalue
- Extremal graphs for edge blow-up of graphs
- Extremal problems in uniformly dense hypergraphs
- Stability theorems for cancellative hypergraphs
- On a valence problem in extremal graph theory
- A note on Turán numbers for even wheels
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Extremal problems for the \(p\)-spectral radius of graphs
- Some extremal problems for hereditary properties of graphs
- Hypergraphs with many Kneser colorings
- Excluding induced subgraphs. II: Extremal graphs
- Independent sets in hypergraphs
- 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
- Minimum \(H\)-decompositions of graphs: edge-critical case
- Turán's theorem inverted
- Unit distances and diameters in Euclidean spaces
- Hypergraph containers
- Extremal graph for intersecting odd cycles
- An extremal graph problem
- Extremal problems for directed graphs
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- Counting substructures. I: Color critical graphs
- A linear hypergraph extension of Turán's theorem
- Turán number and decomposition number of intersecting odd cycles
- On the Turán number of forests
- Turán numbers of bipartite graphs plus an odd cycle
- 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
- Loebl-Komlós-Sós conjecture: dense case
- Two-regular subgraphs of hypergraphs
- Edge-decompositions of graphs with high minimum degree
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- An analytic approach to stability
- The fine structure of octahedron-free graphs
- A hypergraph extension of Turán's theorem
- Two-regular subgraphs of odd-uniform hypergraphs
- Ramsey goodness and generalized stars
- Counting substructures. II: Hypergraphs
- The flag upper bound theorem for 3- and 5-manifolds
- Asymptotic Structure for the Clique Density Theorem
- A proof for a conjecture of Gorgol
- A proof for a conjecture of Gorgol
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)
