The Ramsey number for a triple of long even cycles
From MaRDI portal
(Redirected from Publication:885294)
Recommendations
Cites work
- scientific article; zbMATH DE number 5158529 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- All Ramsey numbers for cycles in graphs
- Generalized Ramsey theory for multiple colors
- Generalized and geometric Ramsey numbers for cycles.
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- On the combinatorial problems which I would most like to see solved
- Path Ramsey numbers in multicolorings
- Ramsey numbers for cycles in graphs
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
Cited in
(48)- Ramsey numbers of 3-uniform loose paths and loose cycles
- Ramsey number of paths and connected matchings in Ore-type host graphs
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
- The Ramsey number for hypergraph cycles. I.
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A multipartite Ramsey number for odd cycles
- The 3-colored Ramsey number of even cycles
- Matchings with few colors in colored complete graphs and hypergraphs
- Ramsey numbers for bipartite graphs with small bandwidth
- Multicolour Ramsey numbers of paths and even cycles
- Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
- An improvement on Łuczak's connected matchings method
- The Ramsey number of a long even cycle versus a star
- On Schelp's problem for three odd long cycles
- Ramsey numbers of large even cycles and fans
- On some multicolor Ramsey properties of random graphs
- Long monochromatic Berge cycles in colored 4-uniform hypergraphs
- Turán‐type problems for long cycles in random and pseudo‐random graphs
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
- The number of triple systems without even cycles
- The Ramsey numbers for a triple of long cycles
- On three-color Ramsey number of paths
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- On the restricted size Ramsey number for a pair of cycles
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
- Bipartite Ramsey numbers of cycles for random graphs
- Bipartite Ramsey numbers of cycles
- Random bipartite Ramsey numbers of long cycles
- Diagonal Ramsey numbers of loose cycles in uniform hypergraphs
- Star versus two stripes Ramsey numbers and a conjecture of Schelp
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
- Multicolored Bipartite Ramsey Numbers of Large Cycles
- Coverings by few monochromatic pieces: a transition between two Ramsey problems
- Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
- Gallai-Ramsey number of even cycles with chords
- Stability for vertex cycle covers
- Color‐biased Hamilton cycles in random graphs
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- The Ramsey number for 3-uniform tight hypergraph cycles
- Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
- Three-colored asymmetric bipartite Ramsey number of connected matchings and cycles
- Ramsey number of a connected triangle matching
- Multipartite Ramsey numbers for odd cycles
This page was built for publication: The Ramsey number for a triple of long even cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885294)
