1,516 reputation
412
bio website
location
age
visits member for 2 years, 7 months
seen 9 hours ago

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
Oct
2
revised Do there exist sparse graphs with large crossing number?
added a note about random graphs
Oct
2
answered Do there exist sparse graphs with large crossing number?
Sep
21
revised Trees with a maximal convex hull: are the only optimal solutions Steiner trees?
added 342 characters in body
Sep
21
answered Square filling self avoiding walk
Sep
21
answered Trees with a maximal convex hull: are the only optimal solutions Steiner trees?
Jul
19
comment Vertex transitive and edge transitive and line graph
$G=K_3+K_{1,3}$ is a counterexample. The line-graph of $G$ is vertex transitive but $G$ is not edge transitive.
Jul
18
awarded  Civic Duty
Jul
12
awarded  Critic
Jun
23
revised Estimate for the travelling salesman problem for balls inside a grid
added 83 characters in body
Jun
23
revised Estimate for the travelling salesman problem for balls inside a grid
added 83 characters in body
Jun
23
answered Estimate for the travelling salesman problem for balls inside a grid
Jun
23
comment Estimate for the travelling salesman problem for balls inside a grid
I see... so then it might be a good idea to edit the question and replace "path" by "walk", as a "path" in a graph usually means that it visits no vertex more than once.
Jun
20
comment Estimate for the travelling salesman problem for balls inside a grid
Regarding question 2), which paths do you consider? What is a "path", actually, by your definition?