Abstract
Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs. Similar results are obtained for characteristic polynomials of submatroids of type ℬ n arrangements.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Birkoff, G.: A determinant formula for the number of ways of coloring a map, chromatic polynomials. Ann. Math. 14, 42–46 (1912)
Brylawski, T.: The broken-circuit complex. Trans. Am. Math. Soc. 234(2), 417–433 (1977)
Brylawski, T., Oxley, J.: The Tutte polynomial and its applications. In: White, N. (ed.) Matroid Applications, pp. 123–225. Cambridge University Press, Cambridge (1992)
Chari, M.: Two decompositions in topological combinatorics with applications to matroid complexes. Trans. Am. Math. Soc. 349(10), 3925–3943 (1997)
Herzog, J., Reiner, V., Welker, V.: The Koszul property in affine semigroup rings. Pac. J. Math. 186, 39–65 (1998)
Hersh, P., Welker, V.: Gröbner basis degree bounds on Tor k[Λ]• (k,k)• and discrete Morse theory for posets. In: Integer Points in Polyhedra—Geometry, Number Theory, Algebra, Optimization. Contemp. Math., vol. 374, pp. 101–138. Am. Math. Soc., Providence (2005)
Hultman, A.: Link complexes of subspace arrangements. Eur. J. Comb. 28, 781–790 (2007)
Jonsson, J.: The topology of the coloring complex. J. Algebr. Comb. 21, 311–329 (2005)
Peeva, I., Reiner, V., Welker, V.: Cohomology of real diagonal subspace arrangements via resolutions. Compos. Math. 117(1), 99–115 (1999)
Stanley, R.: Combinatorics and Commutative Algebra, 2nd edn. Birkhäuser, Boston (1996)
Steingrimsson, E.: The coloring ideal and coloring complex of a graph. J. Algebr. Comb. 14, 73–84 (2001)
Swartz, E.: g-elements, finite buildings and higher Cohen-Macaulay connectivity. J. Comb. Theory Ser. A 113, 1305–1320 (2006)
Wilf, H.: Which polynomials are chromatic? In: Colloquio Internazionale sulle Teorie Combinatorie (Roma 1973), Tomo I, pp. 247–256. Rome (1976)
Zaslavsky, T.: Signed graph coloring. Discret. Math. 39, 215–228 (1982)
Ziegler, G.: Lectures on Polytopes. Springer, New York (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author was supported by NSF grant DMS-0500638. The second author was supported by NSF grant DMS-0245623.
Rights and permissions
About this article
Cite this article
Hersh, P., Swartz, E. Coloring complexes and arrangements. J Algebr Comb 27, 205–214 (2008). https://doi.org/10.1007/s10801-007-0086-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-007-0086-z