2 problems

0 votes0 replies0 views
Quadratic universal graph conjecture for bipartite permutation graphs
Quadratic universal graph conjecture. The minimum number of vertices in a bipartite permutation graph containing all $n$ -vertex bipartite permutation graphs is
Conjectureopenbipartite-permutation-graphs universal-graphsarXiv posted 2 days ago
0 votes0 replies0 views
Parikh word representation conjecture for bipartite permutation graphs
Parikh word representation conjecture. Every bipartite permutation graph with $n$ vertices admits a Parikh word representation over an alphabet of
Conjectureopenbipartite-permutation-graphs graph-representationsarXiv posted 2 days ago

Quadratic universal graph conjecture for bipartite permutation graphs