scientific article; zbMATH DE number 1156862

From MaRDI portal
Publication:4390858





The lattice diameter of a convex lattice polygon \(P\) is the maximal number of collinear points of \(P\). Let \(\alpha(n)\) denote the maximal area of all convex lattice polygon with lattice diameter \(n\). Then the author shows that for \(n \geq 6:n^2-5\leq \alpha(n)\leq n^2-3\). He uses some previous results by Zoltan Füredi, who conjectures that the lower bound is tight.











This page was built for publication:

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