The (t−1) (t-1)‐chromatic Ramsey number for paths

DOI10.1002/JGT.22898MaRDI QIDQ6094047zbMATH OpenFDO

Authors Matija Bucić, Amir Khamseh

Publication date 9 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2101.00779

zbMATH Keywords

Ramsey numbersedge colouring\((t-1)\)-chromatic Ramsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Abstract: The following relaxation of the classical problem of determining Ramsey number of a fixed graph has first been proposed by Erdos, Hajnal and Rado over 50 years ago. Given a graph $G$ and an integer $tgeq2$ determine the minimum number $N$ such that in any $t$-coloured complete graph on $N$ vertices there is a copy of $G$ using only edges of some $t-1$ colours. We determine the answer precisely when $G$ is a path.

Recommendations

• On \((t-1)\)-colored paths in \(t\)-colored complete graphs
• Generalized Ramsey numbers: forbidding paths with few colors
• Generalized Ramsey numbers for paths in 2-chromatic graphs
• On multicolor Ramsey number of paths versus cycles
• On three-color Ramsey number of paths

Cites work

• scientific article; zbMATH DE number 3677884 (Why is no real title available?)
• scientific article; zbMATH DE number 7069639 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• 3-color bipartite Ramsey number of cycles and paths
• A Ramsey‐type problem and the Turán numbers*
• A generalization of Ramsey theory for graphs
• A generalization of Ramsey theory for linear forests
• A generalization of Ramsey theory for stars and one matching
• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• Critical graphs for \(R(P_n,P_m)\) and the star-critical Ramsey number for paths
• Generalized Ramsey numbers for paths in 2-chromatic graphs
• Improved bounds on the multicolor Ramsey numbers of paths and even cycles
• Large sets of \(t\)-designs and a Ramsey-type problem
• List Ramsey numbers
• Matchings with few colors in colored complete graphs and hypergraphs
• Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs
• Multicolour bipartite Ramsey number of paths
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• On \((t-1)\)-colored paths in \(t\)-colored complete graphs
• On a Ramsey type theorem
• On a generalization of Ramsey theory
• Partition relations for cardinal numbers
• Recent developments in graph Ramsey theory
• Star-critical Ramsey numbers
• The oriented size Ramsey number of directed paths
• Three-color Ramsey numbers for paths
• Weakened Gallai-Ramsey numbers
• Weakened Ramsey numbers
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)

Cited in

(3)

• On \(t\)-relaxed chromatic number of \(r\)-power paths
• The power of many colours
• On \((t-1)\)-colored paths in \(t\)-colored complete graphs

This page was built for publication: The (t−1) $(t-1)$‐chromatic Ramsey number for paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094047)