论文标题
巴比伦图
The Babylonian Graph
论文作者
论文摘要
巴比伦图B具有正整数为顶点，如果定义了毕达哥拉斯三重，则连接两个。三角子图对应于欧拉砖。该图的属性是什么？是否有对应于Euler Tesseracts的四面体子图？是否只有一个无限连接的组件？图中有两个欧拉砖是断开连接的吗？ Do the number of edges or triangles in the subgraph generated by the first n vertices grow like of the order n W(n), where n is the product log?我们在这里证明了一些第一个结果，例如b（n）变为非平面的阈值。在附录中，我们包括了关于2009年给出的关于欧拉长方体的演讲的讲义。
The Babylonian graph B has the positive integers as vertices and connects two if they define a Pythagorean triple. Triangular subgraphs correspond to Euler bricks. What are the properties of this graph? Are there tetrahedral subgraphs corresponding to Euler tesseracts? Is there only one infinite connected component? Are there two Euler bricks in the graph that are disconnected? Do the number of edges or triangles in the subgraph generated by the first n vertices grow like of the order n W(n), where n is the product log? We prove here some first results like the threshold where B(n) becomes non-planar. In an appendix, we include handout from a talk on Euler cuboids given in the year 2009.
