Katsabekis, A.2018-04-122018-04-1220170003-889Xhttp://hdl.handle.net/11693/36384In this paper, we investigate the arithmetical rank of a binomial ideal J. We provide lower bounds for the binomial arithmetical rank and the J-complete arithmetical rank of J. Special attention is paid to the case where J is the binomial edge ideal of a graph. We compute the arithmetical rank of such an ideal in various cases. © 2017, Springer International Publishing AG.EnglishArithmetical rankBinomial idealsGraphsIndispensable monomials13F2014M1205C25Article10.1007/s00013-017-1071-y1420-8938