scientific article; zbMATH DE number 3262254
From MaRDI portal
Publication:5548200
zbMath0163.45502MaRDI QIDQ5548200
No author found.
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A conjecture on Gallai-Ramsey numbers of even cycles and paths ⋮ On some three-color Ramsey numbers for paths ⋮ Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Density of monochromatic infinite paths ⋮ Threshold Ramsey multiplicity for odd cycles ⋮ All Ramsey numbers for brooms in graphs ⋮ Ramsey numbers for unions of some cycles ⋮ Ramsey numbers of squares of paths ⋮ Path-kipas Ramsey numbers ⋮ Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles ⋮ Generalized Ramsey numbers through adiabatic quantum optimization ⋮ Anti-van der Waerden numbers on graphs ⋮ Monochromatic cycle partitions of graphs with large minimum degree ⋮ Decompositions of edge-colored infinite complete graphs into monochromatic paths ⋮ On Ramsey numbers for paths versus wheels ⋮ Monochromatic loose path partitions in \(k\)-uniform hypergraphs ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ Ramsey numbers of 3-uniform loose paths and loose cycles ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) ⋮ Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs ⋮ The Ramsey numbers r(P\(_m\),K\(_n\)) ⋮ Critical graphs for \(R(P_n,P_m)\) and the star-critical Ramsey number for paths ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ Complete graphs and complete bipartite graphs without rainbow path ⋮ Ramsey numbers for matchings ⋮ On three-color Ramsey number of paths ⋮ Ordered Ramsey numbers of loose paths and matchings ⋮ The Ramsey number of generalized loose paths in hypergraphs ⋮ Restricted online Ramsey numbers of matchings and trees ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Size of monochromatic components in local edge colorings ⋮ Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths ⋮ An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths ⋮ Path Ramsey Number for Random Graphs ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ Covering the complete graph by partitions ⋮ Ramsey Goodness of Cycles ⋮ Ramsey-minimal graphs for forests ⋮ Bipartite Ramsey numbers of paths for random graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Ramsey numbers of path-matchings, covering designs, and 1-cores ⋮ Vertex coverings by monochromatic cycles and trees ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Covering \(t\)-element sets by partitions ⋮ Coverings by few monochromatic pieces: a transition between two Ramsey problems ⋮ An isoperimetric lemma ⋮ The Ramsey numbers of paths versus wheels: a complete solution ⋮ Closing the gap on path-kipas Ramsey numbers ⋮ Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\) ⋮ Improved bounds on the multicolor Ramsey numbers of paths and even cycles ⋮ On some three color Ramsey numbers for paths, cycles, stripes and stars ⋮ On the Ramsey-goodness of paths ⋮ Partitioning random graphs into monochromatic components ⋮ Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles ⋮ Highly connected monochromatic subgraphs ⋮ Gallai-Ramsey numbers for cycles ⋮ Ramsey-goodness -- and otherwise ⋮ Path-cycle Ramsey numbers ⋮ Path-path Ramsey type numbers for the complete bipartite graph ⋮ On Ramsey numbers for linear forests ⋮ Path-fan Ramsey numbers ⋮ Ramsey numbers for all linear forests ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ The Rado path decomposition theorem ⋮ On the multi-colored Ramsey numbers of paths and even cycles ⋮ Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) ⋮ Covering graphs by monochromatic trees and Helly-type results for hypergraphs ⋮ A degree sequence variant of graph Ramsey numbers ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Bipartite Ramsey numbers of cycles for random graphs ⋮ Generalized Ramsey numbers: forbidding paths with few colors ⋮ Large monochromatic components in colorings of complete 3-uniform hypergraphs ⋮ The Ramsey number of 3-uniform loose path versus star ⋮ New lower bounds on the size-Ramsey number of a path ⋮ Multicolour bipartite Ramsey number of paths ⋮ Threshold Ramsey multiplicity for paths and even cycles ⋮ Stability of the path-path Ramsey number ⋮ On some three color Ramsey numbers for paths and cycles ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ Path-star Ramsey numbers ⋮ Generalised Ramsey numbers for small graphs ⋮ Path Ramsey numbers in multicolorings ⋮ Some Ramsey nu mbers for directed graphs ⋮ Partitioning a graph into a cycle and a sparse graph ⋮ Ramsey and Gallai-Ramsey numbers for the union of paths and stars ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ The Ramsey Numbers of Paths Versus Kipases ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles ⋮ Monochromatic coverings and tree Ramsey numbers ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs ⋮ Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths ⋮ Multicolour Ramsey numbers of paths and even cycles
This page was built for publication:
