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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2017
02419832017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest… (More)
Is this relevant?
2008
2008
Let f(2, 3, 4) denote the smallest integer n such that there exists a K4-free graph of order n for which any 2-coloring of its… (More)
  • table 1
Is this relevant?
2008
2008
We give a very short proof of the following result of Graham from 1980: For any finite coloring of R, d ≥ 2, and for any α > 0… (More)
Is this relevant?
2004
2004
In this work we give efficient molecular computing solutions to eight well-known NP-complete problems, namely the Hamiltonian… (More)
  • table 1
Is this relevant?
2004
2004
In the context of finite metric spaces with integer distances, we investigate the new Ramsey-type question of how many points can… (More)
Is this relevant?
2003
2003
In this paper we give efficient molecular computing solutions to seven well-known NP-complete problems, namely the Hamiltonian… (More)
  • table 1
Is this relevant?
2002
2002
Let R be the set of all finite graphs G with the Ramsey property that every coloring of the edges of G by two colors yields a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Let F (n, k) denote the maximum number of two edge colorings of a graph on n vertices that admit no monochromatic Kk, (a complete… (More)
Is this relevant?
1983
1983
Suppose G is a graph* satisfying the property that if one colors the edges of G in r colors there always is a monochromatic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?