A bridge is an edge whose removal increases the number of connected components. If you delete a bridge, the graph falls apart into separate pieces. Think of a physical bridge connecting two islands. Remove it, and the islands become disconnected.
In graph terms: edge is a bridge if there is no alternate path between and that avoids this edge. Bridges are the weak links that hold the graph together.