scientific article; zbMATH DE number 3262986

From MaRDI portal
Publication:5548826

zbMath0164.24604MaRDI QIDQ5548826

Miklós Simmonovits

Publication date: 1968


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

The chromatic profile of locally colourable graphsStability for the Erdős-Rothschild problemA remark on the number of edge colorings of graphsThe Turán number of disjoint copies of pathsCounting H-free orientations of graphsAn intersection theorem for four setsAdditive approximation for edge-deletion problemsSpectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)Stability for vertex cycle coversThe Turán number of the graph 3P5The maximum spectral radius of wheel-free graphsOn graphs with a large number of edge-colorings avoiding a rainbow triangleExtremal graphs for edge blow-up of graphsTurán number and decomposition number of intersecting odd cyclesThe chromatic profile of locally bipartite graphsGraphs with large maximum degree containing no edge-critical graphsAn extremal graph problemGeneralized Turán problems for double starsPaths are Turán-goodA strengthening of the spectral chromatic critical edge theorem: Books and theta graphsOn supersaturation and stability for generalized Turán problemsGeneralized Turán results for intersecting cliquesTurán numbers for disjoint pathsExtremal graphs for odd wheelsUniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graphOn a generalized Erdős–Rademacher problemGeneralized Turán numbers for the edge blow-up of a graphThe cycle of length four is strictly \(F\)-Turán-goodOn a conjecture of spectral extremal problemsExtremal numbers of disjoint triangles in \(r\)-partite graphsRamsey non-goodness involving booksOn Turán numbers for disconnected hypergraphsTHE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZESome exact results for non-degenerate generalized Turán problemsMaximum cliques in a graph without disjoint given subgraphOn a rainbow extremal problem for color‐critical graphsA Rainbow Erdös--Rothschild ProblemA 2-stable family of triple systemsSpectral extremal graphs for disjoint cliquesLocal Convergence and Stability of Tight Bridge-addable ClassesTurán problems for \(k\)-geodetic digraphsUniversality of Graphs with Few Triangles and Anti-TrianglesAsymptotic Structure of Graphs with the Minimum Number of TrianglesA Bound on the Number of Edges in Graphs Without an Even CycleStability and Turán Numbers of a Class of Hypergraphs via LagrangiansIndependent Sets in Hypergraphs and Ramsey Properties of Graphs and the IntegersThe Turán number for the edge blow-up of trees: the missing caseStability theorems for some Kruskal-Katona type resultsSome exact results of the generalized Turán numbers for pathsCounting substructures and eigenvalues. I: TrianglesExtremal Theory of Locally Sparse MultigraphsStrong Turán stabilityA proof for a conjecture of GorgolExtremal results in sparse pseudorandom graphsOn the cycle space of a random graphEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsEdge-decompositions of graphs with high minimum degreeThe junta method for hypergraphs and the Erdős-Chvátal simplex conjectureThe spectral radius of graphs with no odd wheelsA proof for a conjecture of GorgolThe number of maximal cliques and spectral radius of graphs with certain forbidden subgraphsSome new results on the Turán number of star forestsStrong Turán stabilityExtremal graph problems with symmetrical extremal graphs. Additional chromatic conditionsFinitely forcible graphonsTight bounds on the coefficients of partition functions via stabilityStability of the Potential FunctionSupersaturation problem for the bowtieMinimum rainbow \(H\)-decompositions of graphsThe typical structure of sparse $K_{r+1}$-free graphsStability versions of Erdős-Ko-Rado type theorems via isoperimetryMeasures on monotone properties of graphsHypergraph Removal Lemmas via Robust Sharp Threshold TheoremsMinimal Ramsey graphs on deleting stars for generalized fans and booksUnnamed ItemTwo results about the Turán number of star forestsAsymptotic Structure for the Clique Density TheoremExtremal digraphs avoiding an orientation of \(C_4\)Geometric stability via information theoryThe Turań number of \(2P_7\)On some extremal problems on \(r\)-graphsThe maximum number of colorings of graphs of given order and size: a surveyAnti-Ramsey numbers of doubly edge-critical graphsStability Results for Two Classes of HypergraphsExtremal problems for directed graphsOsculation vertices in arrangements of curvesSharp bounds for decomposing graphs into edges and trianglesGeneralized Turán problems for disjoint copies of graphsDense flag triangulations of 3-manifolds via extremal graph theoryOn a valence problem in extremal graph theoryTight bounds on the coefficients of partition functions via stabilityIndependent sets in hypergraphsStructure and stability of triangle-free set systemsMonotone maps, sphericity and bounded second eigenvalueRamsey Numbers Involving Large BooksA hierarchy of randomness for graphsA hypergraph extension of Turán's theoremExact stability for Turán’s TheoremCounterexamples to Gerbner's conjecture on stability of maximal F‐free graphs




This page was built for publication: