Reputation
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
12 42
Impact
~72k people reached

4h
asked Good embeddings for degree-diameter graphs
7h
answered What is the graph that corresponds to $Q'_8$ generalized quadrangle ? Could you please explain this in plain english?
8h
comment What is the graph that corresponds to $Q'_8$ generalized quadrangle ? Could you please explain this in plain english?
Mathematica does have GraphData[{"GeneralizedQuadrangle", {2, 2}}] and other quadrangles. But GraphData[585] is empty, it doesn't have this particular graph. Graphs with 100+ vertices are typically messy, so it's better to look at the smaller graphs first.
8h
comment Integer Tetrahedra
With 0<m<n<p<16, {{1, 2, 8}, {2, 4, 6}, {2, 6, 8}, {2, 8, 10}, {2, 10, 12}, {2, 12, 14}, {3, 8, 14}, {4, 6, 10}, {4, 8, 12}, {4, 10, 14}, {5, 8, 14}, {6, 8, 9}, {6, 8, 14}, {8, 10, 11}} are the only triples with an integer face opposite (0,0,0), and all of them fail the integer edge requirement. The problem isn't this simple.
11h
comment Integer Tetrahedra
Could you give a few of your many examples?
17h
asked Integer Tetrahedra
1d
asked Tangent Sphere centers
1d
comment Is there any practical use of $0^\circ angles$?
They are good for testing. Programs should be able to handle an input of 0 -- or gracefully handle anything else..
2d
asked Planar Graph Isomorphism
2d
comment How to draw the 5 dimensional hypercube graph with 56 edge crossings?
I use Mathematica, Autocad, and Illustrator. Fairly heavy duty.
Aug
31
answered How to draw the 5 dimensional hypercube graph with 56 edge crossings?
Aug
29
answered How to draw the 5 dimensional hypercube graph with 56 edge crossings?
Aug
27
accepted What are the rules for a Tetartoid pentagon?
Aug
26
comment Does an Eulerian semi-graceful polyhedral graph exist?
Yes, this seems to be correct -- no polyhedral graphs exist in this space. I've been looking at billions of these graphs with my generator. There are a small number of graphs with 3 or fewer vertices with valence less than three, and I'm looking to see if those peter out above a certain number of vertices. I'm also looking at graphs with small numbers of vertices. For 100 edges, what would be the minimal number of vertices?
Aug
26
accepted Does an Eulerian semi-graceful polyhedral graph exist?
Aug
24
revised Does an Eulerian semi-graceful polyhedral graph exist?
added 224 characters in body
Aug
24
comment Does an Eulerian semi-graceful polyhedral graph exist?
I think I see two infinite families for path and cycle+triangle for purely graceful answers. Are there others?
Aug
24
revised How many face we could make regular convex polyhedron
added 12 characters in body
Aug
24
revised Does an Eulerian semi-graceful polyhedral graph exist?
added 253 characters in body
Aug
24
comment Does an Eulerian semi-graceful polyhedral graph exist?
That looks graceful to me.