Skip to search formSkip to main contentSkip to account menu

Monochromatic triangle

In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs,in which the goal is to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The Ramsey number Rn(3) is the smallest positive integer such that colouring the edges of a complete graph on Rn(3) vertices in… 
2016
2016
We say that $G$ is a $(3, 3)$-Ramsey graph if every $2$-coloring of the edges of $G$ forces a monochromatic triangle. The $(3, 3… 
2011
2011
2006
2006
We show that R(3, 3, 3, 3) ≤ 62, that is, any good edge coloring of a complete graph on 62 vertices with four colors must contain… 
2004
2004
In the context of finite metric spaces with integer distances, we investigate the new Ramsey-type question of how many points can… 
2004
2004
In this work we give e(cid:14)cient molecular computing solutions to eight well-known NP-complete problems, namely the… 
1996
1996
The paper gives an account of previous and recent attempts to determine the order of a smallest graph not containing K5 and such… 
1983
1983
An anecdotal account of some of the events and people that have helped shape Ramsey Theory.