The structure and number of global roundings of a graph
Let \(P= (U;E)\) be a connected labelled graph. This article considers the hypergraph \(H_G= (V,{\mathcal P}_G)\), where \(V\) is the set of vertices of \(P\). From this constructions and after the definition of discrepancy, the article deals with the maximum number of integral points in an open unit ball, using the discrepancy distance. The authors introduce some conjectures on this number, and they give some graphs for which these conjectures hold.
scientific article; zbMATH DE number 2110951