The maximum possible toughness among graphs with vertices and edges is considered. This is an analog of the corresponding problem regarding maximum connectivity solved by Harary. We show that, if or , then the maximum toughness is half of the maximum connectivity. The same conclusion is obtained if and . However, maximum toughness can be strictly less than half of maximum connectivity. Some values of maximum toughness are computed for , and some open problems are presented