scientific article; zbMATH DE number 5158529
From MaRDI portal
Publication:3439712
Cited in
(26)- On some three-color Ramsey numbers for paths
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
- Multicolour bipartite Ramsey number of paths
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the multi-colored Ramsey numbers of cycles
- The Ramsey number for a triple of long even cycles
- New upper bound for multicolor Ramsey number of odd cycles
- The 3-colored Ramsey number of even cycles
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
- Multicolour Ramsey numbers of odd cycles
- An improvement on Łuczak's connected matchings method
- On Schelp's problem for three odd long cycles
- Cycles avoiding a color in colorful graphs
- Ramsey results for cycle spectra
- The multicolour Ramsey number of a long odd cycle
- The Ramsey numbers for a triple of long cycles
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Bipartite Ramsey numbers of cycles for random graphs
- Random bipartite Ramsey numbers of long cycles
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- Stability of the path-path Ramsey number
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
- On the multi-colored Ramsey numbers of paths and even cycles
- Ramsey-goodness -- and otherwise
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 Q3439712)
