3 papers
cs.DS2026
An Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
Stephen Arndt, Kirk Pruhs, Trung Tran
We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use …
math.AC2018
Regularity, matchings and Cameron-Walker graphs
Tran Nam Trung
Let be a simple graph and let be the matching number of . It is well-known that $\reg I(G) \leqslant ν(G)+1$. In this paper we show that $\reg I(G) = ν(G)+1$ if and o…
math.AC2016
A Characterization of Gorenstein Planar graphs
Tran Nam Trung
We prove that a planar graph is Gorenstein if and only if its independence complex is Eulerian.