The name "Sidorenko incidence graph" is used in this work for the 35-vertex, 66-edge Levi graph constructed below. The graph is shown above in a planar embedding and a bipartite graph drawing.
Take the 13 points 0, 1, ..., 12 and the following 22 triples as disjoint vertex classes:
 |
Join a point to a triple iff the point belongs to that triple. The resulting bipartite graph is connected and has a trivial group as its graph automorphism group. Each triple-vertex has vertex degree 3; the point-vertices have degrees 4, 5, and 6 with multiplicities 3, 6, and 4, respectively.
