One-way roads: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) Created page with "Found this one on the SUNY Stony Brook Math Problem of the Month archives. ==Puzzle== A county has n > 4 cities. Is it possible to connect some pairs of cities by one-way ro..." |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
A county has n > 4 cities. Is it possible to connect some pairs of cities by one-way roads so that one can travel from every city to every other city using only one or two roads? If so, how? Note that for every pair of cities A and B, only one road connecting A with B is allowed; this road leads from A to B or from B to A, but not both ways. | A county has n > 4 cities. Is it possible to connect some pairs of cities by one-way roads so that one can travel from every city to every other city using only one or two roads? If so, how? Note that for every pair of cities A and B, only one road connecting A with B is allowed; this road leads from A to B or from B to A, but not both ways. | ||
[[Category: Graph theory]] | |||
[[Category: New]] | |||
[[Category: Needs solution]] | |||
Revision as of 08:40, 19 August 2012
Found this one on the SUNY Stony Brook Math Problem of the Month archives.
Puzzle
A county has n > 4 cities. Is it possible to connect some pairs of cities by one-way roads so that one can travel from every city to every other city using only one or two roads? If so, how? Note that for every pair of cities A and B, only one road connecting A with B is allowed; this road leads from A to B or from B to A, but not both ways.