scientific article; zbMATH DE number 3258858

From MaRDI portal
Revision as of 03:29, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5544083

zbMath0161.43306MaRDI QIDQ5544083

No author found.

Publication date: 1968


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



Related Items (53)

Ramsey numbers of fans and large booksEdge-colorings of graphs avoiding complete graphs with a prescribed coloringThe chromatic profile of locally colourable graphsExtremal graph for intersecting odd cyclesRamsey numbers of a fixed odd-cycle and generalized books and fansExtremal graphs of the \(p\)th power of pathsStar-critical Ramsey numbers involving large generalized fansOn the density of a graph and its blowupLarge joints in 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 starsThe extremal graph problem of the icosahedronGeneralized Turán results for intersecting cliquesSome extremal problems for hereditary properties of graphsA stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphsOn a conjecture of spectral extremal problemsRamsey non-goodness involving booksSome exact results for non-degenerate generalized Turán problemsMinimum \(H\)-decompositions of graphs: edge-critical caseLocal Convergence and Stability of Tight Bridge-addable ClassesRamsey numbers of a wheel of order five versus fansExtremal Theory of Locally Sparse MultigraphsAn extension of Turán's theorem, uniqueness and stabilityEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsEdge-decompositions of graphs with high minimum degreeA proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularityHypergraph containersForbidding induced even cycles in a graph: typical structure and countingExcluding induced subgraphs. II: Extremal graphsSome sharp results on the generalized Turán numbersExtremal graph problems with symmetrical extremal graphs. Additional chromatic conditionsRamsey goodness and generalized starsTight bounds on the coefficients of partition functions via stabilityMinimum rainbow \(H\)-decompositions of graphsA stability theorem for maximal \(K_{r+1}\)-free graphsMeasures on monotone properties of graphsMinimal Ramsey graphs on deleting stars for generalized fans and booksStar-critical Ramsey numbers for large generalized fans and booksStar-critical Ramsey numbers of generalized fansA note on stability for maximal \(F\)-free graphsThe number of graphs without forbidden subgraphsExtremal problems for directed graphsOn a valence problem in extremal graph theoryTurán's theorem invertedTight bounds on the coefficients of partition functions via stabilityRamsey Numbers Involving Large BooksDigraph extremal problems, hypergraph extremal problems, and the densities of graph structuresA hierarchy of randomness for graphsA hypergraph extension of Turán's theoremStar-critical Ramsey numbers involving large books






This page was built for publication: