On certain hyperplane arrangements and colored graphs

Abstract: We exhibit a one-to-one correspondence between

3

-colored graphs and subarrangements of certain hyperplane arrangements denoted

m a t h c a l J_{n}

,

n i n m a t h b b 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

c h i_{m a t h c a l J_{n}}

of

m a t h c a l J_{n}

can be expressed in terms of the number of central

3

-colored graphs, and we compute

c h i_{m a t h c a l J_{n}}

for

n = 2, 3

.

Recommendations

Cited In (13)

This page was built for publication: On certain hyperplane arrangements and colored graphs