A Ramsey-type problem in directed and bipartite graphs
From MaRDI portal
Publication:2562874
DOI10.1007/BF02018597zbMath0267.05115MaRDI QIDQ2562874
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (30)
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree ⋮ Vertex covers by monochromatic pieces -- a survey of results and problems ⋮ Monochromatic infinite paths ⋮ Covering with Euclidean boxes ⋮ Ramsey numbers for degree monotone paths ⋮ Local \(k\)-colorings of graphs and hypergraphs ⋮ A Ramsey type result for oriented trees ⋮ Long monochromatic paths and cycles in 2-colored bipartite graphs ⋮ On size multipartite Ramsey numbers of large paths versus wheel on five vertices ⋮ Partitioning edge-coloured complete graphs into monochromatic cycles and paths ⋮ Complete bipartite graphs without small rainbow stars ⋮ An improvement on Łuczak's connected matchings method ⋮ Multicolor bipartite Ramsey numbers for paths, cycles, and stripes ⋮ Complete bipartite graphs without small rainbow subgraphs ⋮ Erdős-Szekeres theorem for multidimensional arrays ⋮ Bipartite Ramsey numbers of cycles ⋮ Monochromatic paths in 2-edge-coloured graphs and hypergraphs ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Calculating Ramsey Numbers by Partitioning Colored Graphs ⋮ Bipartite rainbow Ramsey numbers. ⋮ Unnamed Item ⋮ Ramsey numbers for tournaments ⋮ Directed Ramsey number for trees ⋮ Star-path and star-stripe bipartite Ramsey numbers in multicoloring ⋮ Local colourings and monochromatic partitions in complete bipartite graphs ⋮ Long monochromatic paths and cycles in 2-edge-colored multipartite graphs ⋮ Monochromatic trees in random tournaments ⋮ Multicolour bipartite Ramsey number of paths ⋮ Star-path bipartite Ramsey numbers ⋮ On Ramsey-Turán type problems in tournaments
Cites Work
This page was built for publication: A Ramsey-type problem in directed and bipartite graphs
