Slicing Axes-Parallel Rectangles
Statement
Let us say that two rectangles in the place are independent if both their - and -axis projections are disjoint. A set of rectangles is then independent if the rectangles are pairwise independent. Suppose that a collection of axes-parallel rectangles contains no independent set of size or greater. What is the minimal number, , of horizontal and vertical lines needed to slice every rectangle in the collection?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.