scientific article; zbMATH DE number 3545699

From MaRDI portal
Publication:4120601

zbMath0351.05120MaRDI QIDQ4120601

No author found.

Publication date: 1977


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



Related Items (85)

Ramsey numbers of fans and large booksOn the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus CyclesNew upper bound for multicolor Ramsey number of odd cyclesRamsey numbers of a fixed odd-cycle and generalized books and fansUnnamed ItemA Ramsey problem of Harary on graphs with prescribed sizeWhat can we hope to accomplish in generalized Ramsey theory ?On the size of \((K_t, K_{1, k})\)-co-critical graphsUnnamed ItemRamsey numbers of several \(K_{t,s}\) and a large \(K_{m,n}\)A note on the uniformity threshold for Berge hypergraphsThe Ramsey numbers for disjoint unions of treesDecomposition of large combinatorial structuresRamsey linear families and generalized subdivided graphsA Helly property of arcsRamsey goodness of pathsStar-critical Ramsey numbers involving large generalized fansExtremal theory and bipartite graph-tree Ramsey numbersSmall order graph-tree Ramsey numbersConvergent sequences of iterated \(H\)-line graphsOn the size of \((K_t, P_k)\)-co-critical graphsUnnamed ItemMulticolor star-critical Ramsey numbers and Ramsey-good graphsVertex disjoint copies of \(K_{1 , 4}\) in claw-free graphsRamsey numbers of trees versus fansOn Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphsRamsey for complete graphs with a dropped edge or a triangleA note on lower bounds for induced Ramsey numbersOn the multicolor size Ramsey number of stars and cliquesA large tree is \(tK_m\)-goodPanarboreal graphsRamsey goodness of trees in random graphsGallai-Ramsey numbers for rainbow pathsRamsey non-goodness involving booksClass Ramsey numbers involving induced graphsA note on Ramsey numbers involving large booksRamsey numbers involving a long pathOn Ramsey Size-Linear Graphs and Related QuestionsStar-critical Ramsey numbersRamsey numbers involving large dense graphs and bipartite Turán numbersMaximum clique deleted from Ramsey graphs of a graph and pathsThe Ramsey number for a forest versus disjoint union of complete graphsRamsey numbers of a wheel of order five versus fansRamsey Goodness of CyclesUnnamed ItemSome asymptotic ith Ramsey numbersOn the size of \((K_t,\mathcal{T}_k)\)-co-critical graphsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsRamsey Goodness of Bounded Degree TreesUnnamed ItemTwo results on Ramsey-Turán theoryOn the geometric Ramsey numbers of treesVertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphsRamsey Goodness of Clique Versus Paths in Random GraphsRamsey numbers of trees and unicyclic graphs versus fansThe Ramsey numbers for disjoint unions of graphsRamsey numbers of cubes versus cliquesOn the Ramsey number of the triangle and the cubeRamsey numbers for a disjoint union of good graphsRamsey-goodness -- and otherwiseRamsey goodness and generalized starsGeneralized and geometric Ramsey numbers for cycles.Graph Ramsey theory and the polynomial hierarchyOn mixed Ramsey numbersRamsey numbers of Berge-hypergraphs and related structuresRamsey numbers of trees versus odd cyclesOn the Ramsey numbers for the tree graphs versus certain generalised wheel graphsDeleting edges from Ramsey graphsComplete graph-tree planar Ramsey numbersMaximum subgraphs in Ramsey graphsVertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphsVertex-disjoint stars in \(K_{1 , r}\)-free graphsUnnamed ItemTrees and $n$-Good HypergraphsRamsey numbers for a disjoint union of some graphsA theorem on cycle-wheel Ramsey numberThe Ramsey numbers for cycles versus wheels of even orderDegree sum conditions for oriented forests in digraphsRamsey functions involving \(K_{m,n}\) with \(n\) largeRamsey Numbers Involving Large BooksLarge Book-Cycle Ramsey NumbersNew directions in Ramsey theoryOn graphs \(G\) for which all large trees are \(G\)-goodAn upper bound for the Ramsey numbers \(r(K_ 3,G)\)Ramsey numbers of cycles versus general graphs






This page was built for publication: