The sphericity conjecture for dichotomous ordinal complete graphs
Let denote the minimum dimension required to realize a dichotomous ordinal complete graph on vertices, and let be the sphericity of a graph , namely the least dimension in which has a unit ball representation. Write for the complete bipartite graph with parts of sizes and . Sphericity conjecture.
The complete bipartite graph is a dichotomous ordinal graph and therefore gives a lower bound for . The conjecture asserts that the balanced complete bipartite graph is the most difficult such graph to realize, but the source reports no results establishing it.
References
- Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner and Antonios Symvonis, “Geometric realizations of dichotomous ordinal graphs”, arXiv:2503.07361 (2025).
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.