ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer nn, let UnU_n be a bipartite permutation graph containing every bipartite permutation graph on nn vertices as an induced subgraph, and let u(n)u(n) be the minimum possible number of vertices of such a universal graph.

Quadratic universal graph conjecture. The minimum number of vertices in a bipartite permutation graph containing all nn-vertex bipartite permutation graphs is

Ω(n2).\Omega(n^2).

This conjecture asserts that the optimal universal bipartite permutation graph has quadratic size, matching the intended order of the known construction.

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.