# Topological Drawings of Complete Bipartite Graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9801)

## Abstract

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. We consider a natural class of simple topological drawings of complete bipartite graphs, in which we require that one side of the vertex set bipartition lies on the outer boundary of the drawing. We investigate the combinatorics of such drawings. For this purpose, we define combinatorial encodings of the drawings by enumerating the distinct drawings of subgraphs isomorphic to $$K_{2,2}$$ and $$K_{3,2}$$, and investigate the constraints they must satisfy. We prove in particular that for complete bipartite graphs of the form $$K_{2,n}$$ and $$K_{3,n}$$, such an encoding corresponds to a drawing if and only if it obeys consistency conditions on triples and quadruples. In the general case of $$K_{k,n}$$ with $$k\ge 2$$, we completely characterize and enumerate drawings in which the order of the edges around each vertex is the same for vertices on the same side of the bipartition.

## References

1. 1.
Ábrego, B.M., Aichholzer, O., Fernández-Merchant, S., Ramos, P., Salazar, G.: The 2-page crossing number of $$K_n$$. Discret. Comput. Geom. 49(4), 747–777 (2013)
2. 2.
Blažek, J., Koman, M.: A minimal problem concerning complete plane graphs. In: Fiedler, M. (ed.) Theory of Graphs and Its Applications, pp. 113–117. Czech. Acad. of Sci. (1964)Google Scholar
3. 3.
Cardinal, J., Felsner, S.: Topological drawings of complete bipartite graphs (full version). arXiv:1608.08324 [cs.CG]
4. 4.
Christian, R., Richter, R.B., Salazar, G.: Zarankiewicz’s conjecture is finite for each fixed $$m$$. J. Comb. Theory Ser. B 103(2), 237–247 (2013)
5. 5.
Kynčl, J.: Simple realizability of complete abstract topological graphs in P. Discret. Comput. Geom. 45(3), 383–399 (2011)
6. 6.
Kynčl, J.: Simple realizability of complete abstract topological graphs simplified. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 309–320. Springer, Heidelberg (2015). doi:
7. 7.
Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg Verlag, Berlin (2004)
8. 8.
Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13, 333–338 (1963)
9. 9.
Kratochvíl, J., Lubiw, A., Nešetřil, J.: Noncrossing subgraphs in topological layouts. SIAM J. Discrete Math. 4(2), 223–244 (1991)
10. 10.
Kratochvíl, J., Matoušek, J.: NP-hardness results for intersection graphs. Commentationes Math. Univ. Carol. 30, 761–773 (1989)
11. 11.
Pach, J., Tóth, G.: How many ways can one draw a graph? Combinatorica 26(5), 559–576 (2006)
12. 12.
Zarankiewicz, K.: On a problem of P Turán concerning graphs. Fundamenta Mathematicae 41, 137–145 (1954) 