### 抜粋

A weighted graph is one in which every edge e is assigned a nonnegative number, called the weight of e. The weight of a graph is defined as the sum of the weights of its edges. In 2-edge-c.olored complete graph, by using Ramsey-type theorems, we obtain the existence of monochromatic subgraph which have many edges compared with its order. In this paper, we extend the concept of Ramsey problem to the weighted graphs, and we show the existence of a heavy monochromatic subgraph in 2-edge-colored graph with small order.

元の言語 | English |
---|---|

ページ（範囲） | 331-342 |

ページ数 | 12 |

ジャーナル | Australasian Journal of Combinatorics |

巻 | 34 |

出版物ステータス | Published - 2006 12 1 |

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics

## フィンガープリント Weighted Ramsey problem' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

Fujisawa, J., & Ota, K. (2006). Weighted Ramsey problem.

*Australasian Journal of Combinatorics*,*34*, 331-342.