We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
Pure pairs. IV. Trees in bipartite graphs
Extremal graphs for odd-ballooning of bipartite graphs
![QR code for arXiv:1701.07330 [math.CO]](http://oss.arxitics.com/images/favicon.svg)