1,781 reputation
513
bio website
location
age
visits member for 3 years, 3 months
seen yesterday

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/….
Nov
12
awarded  Nice Answer
Nov
12
revised Do there exist sparse graphs with large crossing number?
corrected constants
Oct
30
revised Are angles between points enough to decide the realizability?
added 17 characters in body
Oct
30
answered Are angles between points enough to decide the realizability?
Oct
4
revised open question on intersecting rectangles - reference request
corrected a name
Oct
3
comment open question on intersecting rectangles - reference request
I agree with bof, the inequalities should probably be $c\sqrt{n}/{\log n} \le m \le \sqrt n$.
Oct
3
answered open question on intersecting rectangles - reference request