scientific article; zbMATH DE number 3262254
From MaRDI portal
Publication:5548200
Cited in
(only showing first 100 items - show all)- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- Large monochromatic components in colorings of complete 3-uniform hypergraphs
- 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
- Ramsey numbers for unions of some cycles
- Ramsey numbers for matchings
- Ramsey-minimal graphs for forests
- Vertex coverings by monochromatic cycles and trees
- Covering \(t\)-element sets by partitions
- An isoperimetric lemma
- Path-cycle Ramsey numbers
- Path-path Ramsey type numbers for the complete bipartite graph
- Ramsey numbers for all linear forests
- Monochromatic coverings and tree Ramsey numbers
- The Ramsey numbers r(P\(_m\),K\(_n\))
- Density of monochromatic infinite paths
- Vertex covering with monochromatic pieces of few colours
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)
- Bipartite Ramsey numbers of paths for random graphs
- On some three color Ramsey numbers for paths, cycles, stripes and stars
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs
- Path-star Ramsey numbers
- Generalised Ramsey numbers for small graphs
- Path Ramsey numbers in multicolorings
- Some Ramsey nu mbers for directed graphs
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs
- Bipartite Ramsey numbers of cycles for random graphs
- The Ramsey number of 3-uniform loose path versus star
- New lower bounds on the size-Ramsey number of a path
- Threshold Ramsey multiplicity for paths and even cycles
- Partitioning a graph into a cycle and a sparse graph
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Anti-van der Waerden numbers on graphs
- Long monochromatic paths and cycles in 2-colored bipartite graphs
- Restricted online Ramsey numbers of matchings and trees
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
- Monochromatic partitions in local edge colorings
- Ramsey numbers of path-matchings, covering designs, and 1-cores
- Ramsey-goodness -- and otherwise
- On Ramsey numbers for linear forests
- The Rado path decomposition theorem
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Generalized Ramsey numbers: forbidding paths with few colors
- Multicolour bipartite Ramsey number of paths
- Ramsey numbers for bipartite graphs with small bandwidth
- Multicolour Ramsey numbers of paths and even cycles
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Path-kipas Ramsey numbers
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Monochromatic loose path partitions in k-uniform hypergraphs
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths
- Complete graphs and complete bipartite graphs without rainbow path
- Size of monochromatic components in local edge colorings
- Highly connected monochromatic subgraphs
- Path-fan Ramsey numbers
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- On some three-color Ramsey numbers for paths
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- 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
- Vertex covers by monochromatic pieces -- a survey of results and problems
- All Ramsey numbers for brooms in graphs
- Ramsey numbers of squares of paths
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Generalized Ramsey numbers through adiabatic quantum optimization
- The Ramsey Numbers of Paths Versus Kipases
- Monochromatic cycle partitions of graphs with large minimum degree
- Ramsey numbers of 3-uniform loose paths and loose cycles
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- The Ramsey numbers of paths versus wheels: a complete solution
- Closing the gap on path-kipas Ramsey numbers
- On the Ramsey-goodness of paths
- Threshold Ramsey multiplicity for odd cycles
- Partitioning random graphs into monochromatic components
- Ramsey goodness of cycles
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- 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
- Diagonal Ramsey numbers of loose cycles in uniform hypergraphs
- On some multicolor Ramsey properties of random graphs
- An alternative proof of the linearity of the size-Ramsey number of paths
- Path Ramsey number for random graphs
- Gallai-Ramsey numbers for cycles
- New directions in Ramsey theory
- Ramsey numbers of cycles versus general graphs
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Local colourings and monochromatic partitions in complete bipartite graphs
- On mixed Ramsey numbers
- Ramsey numbers of ordered graphs
- Generalized and geometric Ramsey numbers for cycles.
- Local colourings and monochromatic partitions in complete bipartite graphs
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
- The multicolor star-critical Gallai-Ramsey number for a path of order 5
- Color‐biased Hamilton cycles in random graphs
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 Q5548200)
