Desert Island Conjectures
For decades, Desert Island Discs has been a popular radio program on the BBC. Its format is for a guest to choose a selection of musical recordings that they would like to have with them if they were stranded on a desert island. In this chapter, we will unashamedly imitate that program and select some conjectures that we would like to have with us were we to be stranded on a desert island. Our selections go back about half a century, to when we were first introduced to graph theory. In the first part of this chapter, our conjectures involve drawings and embeddings of graphs on surfaces, but in the second part, we present one on connectivity.
- 14.L. Glebskii, G. Salazar, The Crossing Number of C m × C n is (m − 2)n for all but finitely many n for each m. J. Graph Theory 47, 53–72 (2004)Google Scholar
- 18.W. Mader, Connectivity and edge-connectivity in finite graphs, in Surveys in Combinatorics, ed. by B. Bollobàbas. London Mathematical Society Lecture Notes, vol. 38 (Cambridge University Press, Cambridge, 979), pp. 66–95Google Scholar
- 20.L.A. Szégedy, Turán’s brick factory problem: the status of the conjectures of Zarankiewicz and Hill, in Graph Theory: Favorite Conjectures and Open Problems - 1, ed. by R. Gera, S. Hedetniemi, C. Larson (Springer, Berlin, 2016), pp. 211–230Google Scholar
- 22.J.M. Vasak, The thickness of the complete graph. Not. Am. Math. Soc 23, A-479 (1976)Google Scholar