Bull. Korean Math. Soc. 2017; 54(2): 375-382
Online first article March 20, 2017 Printed March 31, 2017
https://doi.org/10.4134/BKMS.b150167
Copyright © The Korean Mathematical Society.
Joungmin Song
GIST
We exhibit a one-to-one correspondence between $3$-colored graphs and subarrangements of certain hyperplane arrangements denoted $\mathcal J_n$, $n \in \mathbb N$. We define the notion of centrality of $3$-colored graphs, which corresponds to the centrality of hyperplane arrangements. Via the correspondence, the characteristic polynomial $\chi_{\mathcal J_n}$ of $\mathcal J_n$ can be expressed in terms of the number of central $3$-colored graphs, and we compute $\chi_{\mathcal J_n}$ for $n = 2, 3$.
Keywords: hyperplane arrangements, bipartite graphs, colored graphs
MSC numbers: 32S22, 05C30
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd