#### Filter Results:

#### Publication Year

2003

2006

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- S. Akbari, O. Etesami, H. Mahini, M. Mahmoody
- 2003

In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge coloring of the complete graph K n , there is a Hamil-ton cycle with at most √ 8n different colors. We also prove that in every proper edge coloring of the complete graph K n , there is a rainbow cycle with at least n/2−1 colors (A rainbow cycle is a cycle whose… (More)

In this paper it is shown that every m × n array in which each symbol appears at most (mn − 1)/(m − 1) times has a transversal, when n 2m 3 .

- S Akbari, O Etesami, H Mahini, M Mahmoody, A Sharifi
- 2003

In this paper it is shown that every m × n array in which each symbol appears at most (mn − 1)/(m − 1) times has a latin transversal, when n is large enough in comparison to m.

- ‹
- 1
- ›