The crown graph extremal representation-number conjecture
Let be the crown graph obtained from the complete bipartite graph on two parts of size by deleting a perfect matching. The crown graph extremal conjecture. has the highest representation number among all bipartite graphs on vertices. The representation number of is known to be for , but it remains unknown whether it is maximal among all bipartite graphs on vertices.
References
- Özgür Akgün, Ian P. Gent, Sergey Kitaev and Hans Zantema, “Solving computational problems in the theory of word-representable graphs”, arXiv:1808.01215 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.