Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Hi, I'm very new to graph theory and have a question.

For each positive integer $k$, what is the largest number of bridges in any $k$-vertex graph?


share|cite|improve this question

Hint: In a tree, all edges are bridges. And removing an edge from a cycle of a graph containing a cycle, will not decrease the number of bridges.

share|cite|improve this answer

HINT: Removing a bridge increases the number of components by $1$; what is the largest possible number of components of a graph with $k$ vertices? And if you start with just one component, how many increases of $1$ does it take to reach that largest possible number?

Once you’ve got that, you’ll want an example that actually has the largest possible number of bridges; a very simple graph will do the trick.

share|cite|improve this answer

Just thinking out loud here: but what if the graph is just defined by a "straight line" of vertices and edges? Then each edge would be a bridge. I think this concept is a bit related to the definition of trees. If this is on the right track, then the answer seems quite obvious. The harder part would be to prove this...

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.