Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
DOI10.1007/s00026-009-0037-6zbMath1229.05120arXiv0706.3273OpenAlexW2085349558MaRDI QIDQ659806
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.3273
reciprocity lawcharacteristic polynomialchromatic polynomialTutte polynomialorientationshyperplane arrangementsacyclic orientationscoloring polytopescut-equivalence relationoriented cutssubgroup arrangementstension polynomialtension polytopes
Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorics of partially ordered sets (06A07) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Enumerative combinatorics (05A99)
Related Items (20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the extension of additive functionals on classes of convex sets
- An interpretation for the Tutte polynomial
- Subspace arrangements over finite fields: Cohomological and enumerative aspects
- On valuations, the characteristic polynomial, and complex subspace arrangements
- On characteristic polynomials of subspace arrangements
- Lattice points, Dedekind sums, and Ehrhart polynomials of lattice polyhedra
- Orientations, lattice polytopes, and group arrangements. II: Modular and integral flow polynomials of graphs
- Acyclic orientations of graphs
- Characteristic polynomials of subspace arrangements and finite fields
- Tension polynomials of graphs
- A Class Of Abelian Groups
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Why the characteristic polynomial factors
- Lectures on Polytopes
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs