We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We consider extensions of Turán\u27s original theorem of 1941 to planar grids. For a complete kxm array of vertices, we establish in Proposition 4.3 an exact formula for the maximal number of edges possible without any square regions. We establish with Theorem 4.12 an upper bound and with Theorem 4.15 an asymptotic lower bound for the maximal number of edges on a general grid graph with n vertices and no rectangles
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.