Introduction
The purpose of this document is to provide data about known Betti numbers of unordered configuration spaces of small graphs in order to guide research and avoid duplicated effort.
It contains information for connected multigraphs having at most six edges which contain no loops, no bivalent vertices, and no internal (i.e., nonleaf) bridges. For each such graph there is a table of Betti numbers for configurations of small numbers of points along with Poincaré series which encode Betti numbers for all larger numbers of points. Because the Poincaré series are rational functions, this means that for fixed and , the sequence of th Betti numbers of is eventually polynomial in the number of points in the configuration. For the reader’s convenience, the stable polynomial is also indicated.
The enumeration of the graphs in question was done by hand and verified using Richard Mathar’s preprint [Mat17, Table 61]. The core homology computation was done using Macaulay2 [GS].
The approach uses the fact that the chains of the unordered configuration spaces of a graph are a differential graded module over a polynomial ring with variables the edges of the graph. The calculation is simplified further by a presentation of this differential graded module as the tensor product of finitely generated models for local configurations at the vertices of the graph. This picture was pioneered by Świątkowski
[Świ01]; the action by the polynomial ring was described in [ADCK19] and analyzed in [ADCK18]. Other related work includes the following.
Ko and Park [KP12] calculated the first Betti numbers for all graphs.

Ramos [Ram18] calculated all Betti numbers for trees. For trees all values are stable. In this document, this includes the graphs with fewer than two essential vertices.

Maciążek and Sawicki [MS18] calculated all Betti numbers for theta graphs. In this document, this data is reproduced in a different form in the section for graphs with precisely two essential vertices.
A web version of this document is available here.
Reducing to the kinds of graphs considered here
Betti numbers for unordered configuration spaces of graphs with loops can be obtained by reducing to loopfree graphs with the same number of edges [ADCK18, Lemma 4.6]. Betti numbers for unordered configuration spaces of loopfree graphs with bivalent vertices can be obtained from such information for graphs without bivalent vertices (smoothing bivalent vertices is a homeomorphism and thus does not affect the configuration spaces). Betti numbers for unordered configuration spaces of disconnected graphs can be obtained combinatorially from the counts for connected graphs by summing over all ways of partitioning the desired number of points among the path components (this is true for any locally pathconnected topological spaces and is not particular to graphs). Betti numbers for unordered configuration spaces of graphs with internal bridges can be obtained in a similar combinatorial manner from such information for the graphs obtained by cutting the edge into two leaves [ADCK19, Proposition 5.22]
Notes about the data
The graphs are organized by the number of essential (valence at least three) vertices. They are presented both with images and with adjacency matrices. The number of essential vertices also gives the maximal homological degree of the unordered configuration spaces of a graph; as long as there is at least one essential vertex, this maximal degree is realized for configuration spaces of sufficiently many points (uniformly, twice the number of essential vertices is always enough to realize the maximal degree). The graphs are enumerated essentially at random within the grouping by number of essential vertices. Unstable values are indicated in bold. All values not explicitly included in the tables of data are stable and are calculated by the indicated stable polynomial value.
Notes about the computation
The core computation of a presentation for the homology and all Poincaré series for graphs (the isolated vertex and edge have irregular chain complexes because they have no essential vertices and therefore were computed by hand) took between four and five seconds on a late 2012 MacBook Pro. Pushing the kind of calculation pursued here from graphs with six to seven, eight, or possibly even nine edges should be more or less just a problem of graph enumeration. For example, the full computation for the complete graph with two disjoint edges removed (eight edges) takes under a minute. On the other hand, the full computation for the complete graph with a single edge removed (nine edges) takes seven minutes, and I did not complete the computation for itself (ten edges).
Example code for the core computation looks as follows. It presents a local twostage chain complex model for each vertex and then tensors them together, both over the full polynomial ring on the edges. 1cm1cm
 macaulay script for H_*(B_*(K4)) R = ZZ[e_0, e_1, e_2, e_3, e_4, e_5] C0 = chainComplex matrix e_4  e_0, e_5  e_0 C1 = chainComplex matrix e_1  e_0, e_2  e_0 C2 = chainComplex matrix e_3  e_1, e_5  e_1 C3 = chainComplex matrix e_3  e_2, e_4  e_2 C = C0 ** C1 ** C2 ** C3 H = HH (C) p0 = hilbertSeries (H_0, Reduce => true) p1 = hilbertSeries (H_1, Reduce => true) p2 = hilbertSeries (H_2, Reduce => true) p3 = hilbertSeries (H_3, Reduce => true) p4 = hilbertSeries (H_4, Reduce => true)
1. Data for small graphs
1.0. Data for graphs with 0 essential vertices
Note: values calculated by hand
Betti numbers :
Poincaré series  stable polynomial value  
Note: values calculated by hand
Betti numbers :
Poincaré series  stable polynomial value  
1.1. Data for graphs with 1 essential vertex
Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

1.2. Data for graphs with 2 essential vertices
Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

1.3. Data for graphs with 3 essential vertices
Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Betti numbers :
Poincaré series  stable polynomial value  

Comments
There are no comments yet.