In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs,in which the goal is toâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2008

2008

- Andrzej Dudek, Vojtech RÃ¶dl
- Electronic Notes in Discrete Mathematics
- 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

- Andrzej Dudek, Vojtech RÃ¶dl
- Experimental Mathematics
- 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)

Is this relevant?

2008

2008

- Adrian Dumitrescu, Minghui Jiang
- CCCG
- 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)

Is this relevant?

2004

2004

- Vania Mascioni
- Electr. J. Comb.
- 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)

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)

Is this relevant?

1996

1996

- Raphael Yuster
- Journal of Graph Theory
- 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

- Fan Chung Graham
- Journal of Graph Theory
- 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)

Is this relevant?