Tunnels

Mice built an underground house consisting of chambers and tunnels:

• every tunnel connects one chamber to another (no dead ends),
• exactly three tunnels lead from each chamber to three distinct other chambers,
• from every chamber, a mouse can reach any other chamber,
• there is exactly one tunnel whose removal divides the house into two separate parts.

What is the minimum number of chambers the mouse house could have? Sketch how the chambers could be connected.

Final Answer:

n =  10

Step-by-step explanation:

n=2 5=10



Help us improve the example. If you find a mistake, let us know. Thank you!







You need to know the following knowledge to solve this word math problem:

basic operations and conceptsthemes, topicsGrade of the word problem

Related math problems and questions: