most citedOn the geometry of graph arrangements

2 citations

researchers with a paper here

1 paper

math.CO2004★ 2 cited

On the geometry of graph arrangements

C. De Concini, C. Procesi

We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of…