On (t-1)-colored paths in t-colored complete graphs

zbMATH Open1414.05190MaRDI QIDQ1656293FDOQ1656293

Authors: Amir Khamseh 

Publication date: 10 August 2018

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.bbms/1530065009

Recommendations

• The (t−1) $(t-1)$‐chromatic Ramsey number for paths
• Publication:3480063
• Complete graphs with no rainbow path
• Generalized Ramsey numbers for paths in 2-chromatic graphs
• On three-color Ramsey number of paths

zbMATH Keywords

Ramsey numbersedge coloring$(t-1)$-chromatic Ramsey numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cited In (6)

• On \(s\)--\(t\) paths and trails in edge-colored graphs
• Complete graphs with no rainbow path
• A generalization of Ramsey theory for linear forests
• The (t−1) $(t-1)$‐chromatic Ramsey number for paths
• \([1,1,t]\)-colorings of complete graphs
• Title not available (Why is that?)

This page was built for publication: On \((t-1)\)-colored paths in \(t\)-colored complete graphs

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