Quadratic universal graph conjecture for bipartite permutation graphs
Statement
For each positive integer , let be a bipartite permutation graph containing every bipartite permutation graph on vertices as an induced subgraph, and let 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 -vertex bipartite permutation graphs is
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.