Three utilities problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
The three utilities problem. Can each house be connected to each utility, with no connection lines crossing?
On a plane, one crossing is needed

The classical mathematical puzzle known as the three utilities problem; the three cottages problem or sometimes water, gas and electricity can be stated as follows:

Suppose there are three cottages on a plane (or sphere) and each needs to be connected to the water, gas, and electricity companies. Without using a third dimension or sending any of the connections through another company or cottage, is there a way to make all nine connections without any of the lines crossing each other?

The problem is an abstract mathematical puzzle which imposes constraints that would not exist in a practical engineering situation. It is part of the mathematical field of topological graph theory which studies the embedding of graphs on surfaces. In more formal graph-theoretic terms, the problem asks whether the complete bipartite graph K3,3 is planar.[1] This graph is often referred to as the utility graph in reference to the problem;[2] it has also been called the Thomsen graph.[3]


A review of the history of the three utilities problem is given by Kullman (1979). He states that most published references to the problem characterize it as "very ancient".[4] In the earliest publication found by Kullman, Henry Dudeney (1917) names it "water, gas, and electricity". However, Dudeney states that the problem is "as old as the hills...much older than electric lighting, or even gas".[5] Dudeney also published the same puzzle previously, in The Strand Magazine in 1913.[6]

Another early version of the problem involves connecting three houses to three wells.[7] It is stated similarly to a different (and solvable) puzzle that also involves three houses and three fountains, with all three fountains and one house touching a rectangular wall; the puzzle again involves making non-crossing connections, but only between three designated pairs of houses and wells or fountains, as in modern numberlink puzzles.[8]

Mathematically, the problem can be formulated in terms of graph drawings of the complete bipartite graph K3,3. This graph makes an early appearance in Henneberg (1908).[9] It has six vertices, split into two subsets of three vertices, and nine edges, one for each of the nine ways of pairing a vertex from one subset with a vertex from the other subset. The three utilities problem is the question of whether this graph is a planar graph.[1]


The utility graph, also known as the Thomsen graph or K3,3
Proof without words: One house is temporarily deleted. The lines connecting the remaining houses with the utilities divide the plane into three regions, shaded yellow, red and blue. Whichever region the deleted house is placed into, the utility similarly coloured is outside the region. The Jordan curve theorem states that a line connecting them must intersect one of the existing lines.

As it is usually presented (on a flat two-dimensional plane), the solution to the utility puzzle is "no": there is no way to make all nine connections without any of the lines crossing each other. In other words, the graph K3,3 is not planar. Kazimierz Kuratowski stated in 1930 that K3,3 is nonplanar,[10] from which it follows that the problem has no solution. Kullman, however, states that "Interestingly enough, Kuratowski did not publish a detailed proof that [ K3,3 is ] non-planar".[4]

One proof of the impossibility of finding a planar embedding of K3,3 uses a case analysis involving the Jordan curve theorem. In this solution, one examines different possibilities for the locations of the vertices with respect to the 4-cycles of the graph and shows that they are all inconsistent with a planar embedding.[11]

Alternatively, it is possible to show that any bridgeless bipartite planar graph with V vertices and E edges has E ≤ 2V − 4 by combining the Euler formula VE + F = 2 (where F is the number of faces of a planar embedding) with the observation that the number of faces is at most half the number of edges (the vertices around each face must alternate between houses and utilities, so each face has at least four edges, and each edge belongs to exactly two faces). In the utility graph, E = 9 and 2V − 4 = 8, violating this inequality, so the utility graph cannot be planar.[12]


K3,3 drawn with only one crossing.
Solution to the three utilities problem on a torus.

Two important characterizations of planar graphs, Kuratowski's theorem that the planar graphs are exactly the graphs that contain neither K3,3 nor the complete graph K5 as a subdivision, and Wagner's theorem that the planar graphs are exactly the graphs that contain neither K3,3 nor K5 as a minor, make use of and generalize the non-planarity of K3,3.

K3,3 is a toroidal graph, which means it can be embedded without crossings on a torus. In terms of the three cottage problem this means the problem can be solved by punching two holes through the plane (or the sphere) and connecting them with a tube. This changes the topological properties of the surface and using the tube allows the three cottages to be connected without crossing lines. An equivalent statement is that the graph genus of the utility graph is one, and therefore it cannot be embedded in a surface of genus less than one. A surface of genus one is equivalent to a torus. A toroidal embedding of K3,3 may be obtained by replacing the crossing by a tube, as described above, in which the two holes where the tube connects to the plane are placed along one of the crossing edges on either side of the crossing. Another way of changing the rules of the puzzle is to allow utility lines to pass through the cottages or utilities; this extra freedom allows the puzzle to be solved.

Pál Turán's "brick factory problem" asks more generally for a formula for the minimum number of crossings in a drawing of the complete bipartite graph Ka,b in terms of the numbers of vertices a and b on the two sides of the bipartition. The utility graph K3,3 may be drawn with only one crossing, but not with zero crossings, so its crossing number is one.[13]

Other graph-theoretic properties[edit]

The utility graph K3,3 is a circulant graph. It is the (3,4)-cage, the smallest triangle-free cubic graph.[3] Like all other complete bipartite graphs, it is a well-covered graph, meaning that every maximal independent set has the same size. In this graph, the only two maximal independent sets are the two sides of the bipartition, and obviously they are equal. K3,3 is one of only seven 3-regular 3-connected well-covered graphs.[14]

It is also a Laman graph, meaning that it forms a minimally rigid system when it is embedded (with crossings) in the plane. It is the smallest example of a nonplanar Laman graph, as the other minimal nonplanar graph, K5, is not minimally rigid.


  1. ^ a b Bóna, Miklós (2011), A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory, World Scientific, pp. 275–277, ISBN 9789814335232. Bóna introduces the puzzle (in the form of three houses to be connected to three wells) on p. 275, and writes on p. 277 that it "is equivalent to the problem of drawing K3,3 on a plane surface without crossings".
  2. ^ Utility Graph from
  3. ^ a b Coxeter, H. S. M. (1950), "Self-dual configurations and regular graphs", Bulletin of the American Mathematical Society, 56: 413–455, doi:10.1090/S0002-9904-1950-09407-5, MR 0038078.
  4. ^ a b Kullman, David (1979), "The Utilities Problem", Mathematics Magazine, 52 (5): 299–302, JSTOR 2689782.
  5. ^ Dudeney, Henry (1917), "Problem 251 – Water, Gas, and Electricity", Amusements in mathematics, Thomas Nelson
  6. ^ Dudeney, Henry (1913), "Perplexities, with some easy puzzles for beginners", The Strand Magazine, vol. 46, p. 110.
  7. ^ "Puzzle", Successful Farming, vol. 13, p. 50, 1914; "A well and house puzzle", The Youth's Companion, vol. 90 no. 2, p. 392, 1916.
  8. ^ "32. The fountain puzzle", The Magician's Own Book, Or, The Whole Art of Conjuring, New York: Dick & Fitzgerald, 1857, p. 276.
  9. ^ Henneberg, L. (1908), "Die graphische Statik der starren Körper", Encyklopädie der Mathematischen Wissenschaften, 4.1, pp. 345–434. As cited by Coxeter (1950). See in particular p. 403.
  10. ^ Kuratowski, Kazimierz (1930), "Sur le problème des courbes gauches en topologie" (PDF), Fund. Math. (in French), 15: 271–283.
  11. ^ Trudeau, Richard J. (1993), Introduction to Graph Theory (Corrected, enlarged republication. ed.), New York: Dover Pub., pp. 68–70, ISBN 978-0-486-67870-2, retrieved 8 August 2012
  12. ^ Kappraff, Jay (2001), Connections: The Geometric Bridge Between Art and Science, K & E Series on Knots and Everything, 25, World Scientific, p. 128, ISBN 9789810245863.
  13. ^ Pach, János; Sharir, Micha (2009), "5.1 Crossings—the Brick Factory Problem", Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical Surveys and Monographs, 152, American Mathematical Society, pp. 126–127.
  14. ^ Campbell, S. R.; Ellingham, M. N.; Royle, Gordon F. (1993), "A characterisation of well-covered cubic graphs", Journal of Combinatorial Mathematics and Combinatorial Computing, 13: 193–212, MR 1220613.

External links[edit]