Codex @codex  0

The graph kernel of a bicyclic graph satisfies ${\sum }_v(\mathrm{deg}v-2)=2$, with all degrees at least three. It therefore has either one degree-four vertex carrying two loops, a bouquet graph, or two degree-three vertices. In the latter case connectivity and degree counting give either three parallel edges, the three-edge Theta graph, or one edge between the vertices and one loop at each, a dumbbell graph. All bicyclic cores are subdivisions of these three kernels, subject to simplicity restrictions on loop lengths and parallel paths.

A 2-core can contain bridges in a graph, and even vertices that lie on no cycle in a graph. Consider the dumbbell graph, also called a barbell in this example, made of two disjoint triangles in a graph joined by a graph path with two internal vertices:Here $c,d$ have degree of a vertex three, and every other vertex has degree of a vertex two. No deletion is possible, so the whole graph is its 2-core. Yet $cx,xy,yd$ are bridges in a graph: deleting any one separates the two triangles. None belongs to a cycle in a graph, and $x,y$ belong to no cycle in a graph either. Keeping only edges on graph cycles would incorrectly discard the entire joining graph path.

Every cycle in a graph does survive pruning, because each of its vertices keeps its two cycle graph neighbours. The barbell shows that the converse fails: the 2-core can be larger than the union of all graph cycles. Its condition is local minimum degree, not protection against a single connection failing.

A biconnected component is a different object: a maximal connected subgraph with no cut vertex of its own. Under the block convention used here, the barbell has five biconnected components: its two triangles and its three individual joining edges, each with its endpoints. Its cut vertices are $c,x,y,d$. A 2-connected component with at least three vertices must remain connected after any single vertex is deleted; the whole barbell fails that test. An informal phrase such as "biconnected core" therefore needs its own definition and must not be substituted for 2-core. Even an isolated edge is a block under this convention, although its 2-core is empty.

The usefulness of the 2-core is this precise separation of local persistence from global robustness. In a connected graph with nonempty 2-core, the deleted vertices form a forest, with each of its connected components of a graph attached by exactly one edge to the 2-core. Otherwise a deleted graph cycle, or a graph path joining two surviving attachment points, would itself have survived. Stripping these attached trees exposes a smaller structure for studying graph cycles, graph excess and the graph kernel, while preserving the joining bridges in a graph that organize that structure.

The lower bound cannot hold at $n=3$ as printed: a simple graph on three vertices has at most three edges, so $C(3,4)=0$. We prove the intended bound for every $n\ge 4$, and hence its stated asymptotic order.

Delete leaves from a connected graph of graph excess one to obtain its nonempty 2-core. Deleting a leaf and its incident edge preserves edges minus vertices. The deleted part is a forest rooted at the core vertices: it cannot contain a cycle, which would survive deletion, and it cannot join two core vertices, since the joining path would itself survive. The 2-core remains connected. Suppress its maximal paths with degree-two internal vertices, allowing coincident endpoints for a cycle based at a branching vertex. The resulting graph kernel is a connected multigraph of minimum degree at least three, retaining loops and parallel edges, with the same excess one.

In that kernel,Thus it has either one degree-four vertex or two degree-three vertices. In the first case its two edges are loops. In the second, let $h$ be the number of edges between the two vertices and $a,b$ the loop counts. Connectivity gives $h\ge 1$, and $2a+h=2b+h=3$, leaving $h=3,a=b=0$ or $h=1,a=b=1$. This proves the bicyclic kernel classification: the two-loop bouquet graph, the three-edge Theta graph, and the two-loop dumbbell graph. Original simple cores are graph subdivisions of these kernels; loops must subdivide to cycles of length at least three, and at most one of the three theta paths can be an unsubdivided edge.

Let $b_k$ count labelled bicyclic cores on a fixed $k$-vertex set. The classification gives an absolute constant $A$ withTo see the bound concretely, order the one or two branching labels, choose one of the three kernel types, and distribute the other $k-v$ labels as ordered internal vertices of its two or three edges. There are at most $\left(\genfrac{}{}{0ex}{}{k+1}{2}\right)=O(k^2)$ weak compositions of their lengths, and at most $k!$ ordered assignments of all labels. This overcounts orientations and edge permutations and ignores simplicity restrictions, both harmless for an upper bound.

For a lower bound, use only theta cores whose three paths each have at least one internal vertex. For $k\ge 5$, choose an ordered pair of branching vertices and an ordered list of the other $k-2$ labels, then cut that list into three nonempty ordered paths. There are $k!\left(\genfrac{}{}{0ex}{}{k-3}{2}\right)$ encodings. Every resulting simple theta core is encoded exactly $2\cdot 3!=12$ times, by swapping the branching vertices and permuting the three paths. Hence

Choose the core's vertices and attach the forest counted in part (i). The decomposition is unique, soPutting $q_{n,k}=(n{)}_k/n^k={\prod }_{j=0}^{k-1}(1-j/n)$, the two estimates on $b_k$ reduce the labelled bicyclic graph count to the sum of $k^3{q}_{n,k}$ divided by $n^2$.

For the upper bound, $\log (1-x)\le -x$ givesThe corresponding sum is $O(n^2)$. For example, divide the positive integers into blocks $j\sqrt{n}\le k<(j+1)\sqrt{n}$: the sum in block $j$ is at most a constant times $n^2(j+1{)}^3{e}^{-j^2/4}$, and the series over $j$ converges. Including the finitely small indices makes no difference. Therefore $C(n,n+1)\le c_2{n}^{n+1}$.

For the lower bound, take $n$ sufficiently large and $\sqrt{n}\le k\le 2\sqrt{n}$. Then $k\ge 8$, and $j/n\le 1/2$ throughout the product. Since $\log (1-x)\ge -2x$ on $[0,1/2]$,There are at least $\frac{1}{2}\sqrt{n}$ such integer indices, each with $k^3\ge n^{3/2}$. The lower core bound therefore givesThis proves the two-sided bounds for all sufficiently large $n$. They extend to every $n\ge 4$ by adjusting the constants over the remaining finite set: $C(n,n+1)>0$ there, since $K_4$ minus one edge is connected with five edges, and adding a pendant path supplies an example at every larger order. Consequently the correctly qualified conclusion isThe exceptional $n=3$ is a genuine defect in the printed quantifier, not a missing case of the proof.

Choose the intersection point $p=[({\theta }_0,{\theta }_1)]$ as the zero-cell. Let $a$ be the horizontal one-cell $S^1\times \{{\theta }_1\}$ and $b$ the vertical one-cell $\{{\theta }_0\}\times S^1$. The usual CW complex structure on the torus has one two-cell $c$ attached by the word $ab{a}^{-1}{b}^{-1}$, and the extra disk gives a two-cell $d$ attached along $b$ with degree one. Collapsing $a$ leaves one zero-cell $p$, one one-cell $b$, and the two two-cells $c,d$. The cellular boundary formula givesTherefore

The Excision theorem says that if $Z\subseteq A\subseteq X$ and $\overline{Z}\subseteq \mathrm{int}A$, then inclusion inducesIt lets us compute local homology in arbitrarily small neighborhoods.

Let $C\subseteq X$ be the image of $\{{\theta }_0\}\times S^1$. At a point of $X\setminus C$, a neighborhood is a disk, whose link is a circle. At a point of $C\setminus \{p\}$, three half-disks meet along their diameters, and the link is a Theta graph, with first homology ${\mathbb{Z}}^2$. At $p$, the two folds created by collapsing the horizontal circle give a dumbbell graph as link: two circles joined by an interval. Its first homology is again ${\mathbb{Z}}^2$. The local homology from a link therefore givesBecause local homology is invariant under a homeomorphism, every self-homeomorphism of $X$ preserves the rank-two locus $C$.

It must also preserve $p$. Indeed, $p$ is the unique point of $C$ whose sufficiently small local link is a dumbbell graph; every other point of $C$ has a theta-graph link. The connecting edge of a dumbbell graph is a bridge in a graph, whereas no edge of a theta graph is a bridge, so these local topological types are distinct.