ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let us say that two rectangles in the place are independent if both their xx- and yy-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 mm or greater. What is the minimal number, f(m)f(m), 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.