Contracting every strongly connected component of a directed graph produces a DAG. I want the notation, the mechanism, and the failure mode visible at the same time.
Objects and notation
Connectivity asks how many vertices or edges must be removed to disconnect a graph \(G\). Depth-first search timestamps \(\operatorname{tin}(v)\) and low-link values \(\operatorname{low}(v)\) expose local cut structure.
The formulas should not be merged too early. The datum \(\mathsf D\), the conclusion \(\mathsf C\), and the bridge \(\Longrightarrow\) have three different logical jobs.
Push the symbols
A worked instance is useful here because it exposes every index that the compressed statement hides.
Structural reading
The invariant statement is the one that does not depend on a convenient choice of coordinates, representatives, basis, or enumeration.
A hypothesis worth keeping
Bridge and articulation criteria depend on DFS-tree relationships. Applying them to an arbitrary spanning tree gives false positives.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.