#101 · wccanard
12 Feb 2008
"Yes, he needs to start some games": this was put in a year or so ago by Richard, to stop spam. The idea was that it was probably harder to write code for spambots if they also had to be able to play a passable game of hex :-)
The infinite graph: perhaps a way of making your question meaningful is to ask for a locally finite tiling of R^2 [so every point in R^2 has to be either a vertex, or on a piecewise smooth edge with finite length, or in a polygon with finite area and piecewise smooth edges blah blah blah] and which has the right local properties. Then you don't have to worry about infinite regions or "dot dot dots" in the middle of graphs. My guess is that this is what you implicitly mean. So, for example, my infinite glueing of pentagons above wouldn't count above because it can't immediately be tweaked to cover all of R^2.
It wouldn't surprise me if one could take one of the examples above, arrange it so it has a square as a boundary, and then tile the plane with squares in the obvious way and put a copy of the graph into the square in a sufficiently clever way (the issue is the orientation) that gives an example of an infinite graph with a global bound (16 or so) on the degrees of the vertices. But I didn't try this yet, and it might not work. A good exercise :-) It won't give a 3,4,5 tiling though.