A Ramsey-type problem in directed and bipartite graphs
From MaRDI portal
Publication:2562874
DOI10.1007/BF02018597zbMATH Open0267.05115MaRDI QIDQ2562874FDOQ2562874
Authors: Yanyan Li 
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (31)
- Erdős-Szekeres theorem for multidimensional arrays
- Multicolour bipartite Ramsey number of paths
- Ramsey numbers for degree monotone paths
- On size multipartite Ramsey numbers of large paths versus wheel on five vertices
- Complete bipartite graphs without small rainbow subgraphs
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Partitioning 3-coloured complete graphs into three monochromatic paths
- On Ramsey-Turán type problems in tournaments
- Partitioning edge-coloured complete graphs into monochromatic cycles and paths
- Monochromatic paths in 2-edge-coloured graphs and hypergraphs
- The bipartite Ramsey numbers \(\operatorname{BR}(C_8, C_{2n})\)
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- An improvement on Łuczak's connected matchings method
- Monochromatic trees in random tournaments
- Covering with Euclidean boxes
- Long monochromatic paths and cycles in 2-colored bipartite graphs
- Ramsey numbers of sparse digraphs
- Calculating Ramsey numbers by partitioning colored graphs
- Local \(k\)-colorings of graphs and hypergraphs
- A Ramsey type result for oriented trees
- Ramsey numbers for tournaments
- Local colourings and monochromatic partitions in complete bipartite graphs
- Bipartite rainbow Ramsey numbers.
- Bipartite Ramsey numbers of cycles
- Star-path bipartite Ramsey numbers
- Star-path and star-stripe bipartite Ramsey numbers in multicoloring
- Complete bipartite graphs without small rainbow stars
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Monochromatic infinite paths
- Multicolor bipartite Ramsey numbers for paths, cycles, and stripes
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
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)
