Follow

Draw an infinite subgraph of the 3d integer lattice in which each vertex has four co-planar neighbors, in a perpendicular plane to each of its neighbors. This completely determines the subgraph, which is 4-regular and highly symmetric. It is the graph of adjacencies of the cubes in this structure: en.wikipedia.org/wiki/Tetrasti . Does this graph have a name and history?

· · Web · 1 · 1 · 3

@11011110 The answer to your question appears to be "no", and a few people have done some investigation.

Are you still interested?

Do you have an email address for contact, or would you rather continue here?

@ColinTheMathmo Sure, especially if you have published references that might help beef up the Wikipedia tetrastix article. My email is linked from my home page linked from my profile here, but less indirectly it's david.eppstein@gmail.com

@11011110 Sorry, didn't see this reply ... I'll collate what I have and send it to you later today.

Sign in to participate in the conversation
Mathstodon

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!