The Setting
Take the thirteen points of , where , and a fixed list of 22 triples of them, the faces. The pattern is the point-face incidence graph of this configuration, a bipartite graph with 35 vertices and 66 edges.✦ A host graph is measured against it by the homomorphism density and the edge density , the two quantities that Sidorenko’s conjecture compares for a bipartite pattern.
The Definition
The library lists the faces explicitly and defines the homomorphism count and both densities for arbitrary finite simple graphs and , so that is the case .
Definition 1. The faces are the 22 three-element subsets of the point set given by (1)✦
The vertex set of the pattern is the disjoint union of the points and the faces, with a vertex for each point and a vertex for each face : (2)✦
The incidence relation on holds between a point and a face , in either order, exactly when the point lies in the face, and never between two points or two faces: (3)✦
The pattern graph is the simple graph on whose edges are the incident pairs, (4)✦
For finite simple graphs and , the homomorphism count is the number of maps , injective or not, that send every edge of to an edge of : (5)✦
For finite simple graphs and , the homomorphism density of in is the real number (6)✦
The edge density of a finite simple graph is the real number (7)✦
In the paper, the result reads: for finite simple graphs and (the page’s and ), with counting all edge-preserving maps, and ; the pattern is the incidence graph of the 22 triples of Table 1, the page’s faces .
What Is Checked
The pattern is stated over the faces (1) and the incidence relation (3) on the vertex set (2), and the count (5) and the densities (6) and (7) over an arbitrary pair of finite simple graphs and , the densities taking real values.