Reputation
1,903
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
5 14
Newest
 Nice Answer
Impact
~12k people reached

Dec
29
answered Show that the Minkowski sum of two triangles in 3D is the union of Minkowski sums of each triangle along the other's edges?
Dec
29
revised Show that the Minkowski sum of two triangles in 3D is the union of Minkowski sums of each triangle along the other's edges?
corrected formula: $e \in B$ to $e \in A$ and vice versa. Since "Edits must be at least 6 characters", changed corners to vertices as well.
Dec
29
suggested approved edit on Show that the Minkowski sum of two triangles in 3D is the union of Minkowski sums of each triangle along the other's edges?
Dec
21
awarded  Nice Answer
Dec
19
comment Always a planar-drawn cycle through $n$ points
Yes, it could. But the length will decrease, and there are only finitely many Hamiltonian cycles, so after a finite number of these operations we will get a noncrossing cycle. This might not be a very efficient algorithm though.
Dec
19
answered Always a planar-drawn cycle through $n$ points
Nov
21
comment Zero-one links: how many, and how to produce?
here is the Wikipedia article: en.wikipedia.org/wiki/De_Bruijn_sequence
Aug
9
comment Forbidden Tripartite Graphs
I have added a direct reference to a more precise upper bound, which is also mentioned at the Wikipedia page.
Aug
9
revised Forbidden Tripartite Graphs
added 236 characters in body
Aug
9
answered Forbidden Tripartite Graphs
May
29
awarded  Yearling
May
9
answered Probability of sub-sequence of exact length to occur
May
5
revised Do there exist sparse graphs with large crossing number?
added another construction satisfying 1-3
Apr
16
answered Reference request: monochromatic paths in edge-colored complete graphs
Apr
15
comment Reference request: monochromatic paths in edge-colored complete graphs
I think these results would be for paths with $k$ vertices; the question is about paths of length $k$, so $k+1$ vertices.
Apr
11
awarded  Nice Answer
Apr
11
answered Can any simplex shadow-project to a regular simplex?
Apr
9
revised How many unit simplices are needed to cover a unit $n$-cube?
added 389 characters in body
Apr
9
answered How many unit simplices are needed to cover a unit $n$-cube?
Apr
9
comment How many unit simplices are needed to cover a unit $n$-cube?
I asked the latter question here: mathoverflow.net/questions/139161/….