Reverse discrepancy and almost zero-sum stars

From MaRDI portal
Publication:6404779




Abstract: For f chosen from the 1,1-valued functions on the edges of a hypergraph mathcalH=(V,E) with sumeinEf(e)=0, how large can one make minvinV|sumeivf(e)|? This question may be viewed as a reverse version of the hypergraph discrepancy problem or as a relaxation of the zero-sum Ramsey problem for stars. We prove exact results when mathcalH is a complete or equipartite hypergraph.











This page was built for publication: Reverse discrepancy and almost zero-sum stars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404779)