output
19922026
Showing 2009 · math.COShow all

5 papers · 2 filters

math.CO2009★ 2 cited

Viewing counting polynomials as Hilbert functions via Ehrhart theory

Felix Breuer, Aaron Dall

Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of…

math.CO2009★ 20 cited

Optimal bounds for the colored Tverberg problem

Pavle V. M. Blagojević, Benjamin Matschke, Günter M. Ziegler

We prove a "Tverberg type" multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of B…

math.CO2009★ 31 cited

Ehrhart theory, Modular flow reciprocity, and the Tutte polynomial

Felix Breuer, Raman Sanyal

Given an oriented graph G, the modular flow polynomial counts the number of nowhere-zero Z_k-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehr…

math.CO2009★ 6 cited

Flip Graphs of Degree-Bounded (Pseudo-)Triangulations

Oswin Aichholzer, Thomas Hackl, David Orden +4

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant . In particular, we consider triangulations of sets of points in convex position…

math.CO2009★ 44 cited

On locally constructible spheres and balls

Bruno Benedetti, Günter M. Ziegler

Durhuus and Jonsson (1995) introduced the class of "locally constructible" (LC) 3-spheres and showed that there are only exponentially-many combinatorial types of simplicial LC 3-s…