A Ramsey-type problem in directed and bipartite graphs
From MaRDI portal
Publication:2562874
Cites work
Cited in
(41)- On Ramsey-Turán type problems in tournaments
- Covering with Euclidean boxes
- Local k-colorings of graphs and hypergraphs
- Bipartite rainbow Ramsey numbers.
- Star-path bipartite Ramsey numbers
- Long monochromatic paths and cycles in 2-colored bipartite graphs
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Multicolour bipartite Ramsey number of paths
- Monochromatic infinite paths
- Ramsey numbers for degree monotone paths
- Multicolor bipartite Ramsey numbers for paths, cycles, and stripes
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Partitioning 3-coloured complete graphs into three monochromatic paths
- Calculating Ramsey numbers by partitioning colored graphs
- A Ramsey type result for oriented trees
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Monochromatic trees in random tournaments
- On size multipartite Ramsey numbers of large paths versus wheel on five vertices
- Star-path and star-stripe bipartite Ramsey numbers in multicoloring
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- Ramsey numbers for tournaments
- Local colourings and monochromatic partitions in complete bipartite graphs
- Complete bipartite graphs without small rainbow stars
- An improvement on Łuczak's connected matchings method
- Complete bipartite graphs without small rainbow subgraphs
- Erdős-Szekeres theorem for multidimensional arrays
- Bipartite Ramsey numbers of cycles
- The bipartite Ramsey numbers \(\operatorname{BR}(C_8, C_{2n})\)
- Ramsey numbers of sparse digraphs
- A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers
- Monochromatic stars and matchings in complete multipartite graphs
- Monochromatic cycles in 2-edge-colored bipartite graphs
- On size multipartite Ramsey numbers involving complete graphs
- Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
- On the multicolor Ramsey numbers of balanced double stars
- Density of monochromatic infinite subgraphs. II
- The \(m\)-bipartite Ramsey number \(\operatorname{BR}_m(H_1,H_2)\)
- Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
- Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
This page was built for publication: A Ramsey-type problem in directed and bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2562874)
