Reputation
1,808
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
13 27
Impact
~126k people reached

Jun
27
awarded  Notable Question
Jun
21
awarded  Popular Question
Apr
29
awarded  Popular Question
Apr
3
awarded  Nice Answer
Feb
11
awarded  Favorite Question
Nov
24
awarded  Nice Answer
Nov
9
awarded  Yearling
Sep
30
awarded  Explainer
Aug
8
awarded  Popular Question
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
Mar
31
comment Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
This is also a counter-example I have been looking at. I think it might be possible to give a proof of the maximality of the rectangle by somehow deriving the area as a function of the rectangles rotation.
Mar
30
revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
edited body
Mar
25
revised Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
Added what I think
Mar
25
asked Can all polygons outside of the largest inscribed rectangle in a convex polygon be concave
Mar
3
awarded  Nice Answer
Feb
4
comment Finding the number of Spanning Trees of a Graph $G$
Yes, I am one of the two authors (David). I have uploaded the main LaTeX files (and the chapter about spanning trees) here: dropbox.com/s/j1amlwqjk1x13cc/graphnotes.zip Basically, it is a somewhat customised Memoir template, and all figures are made with TikZ.
Feb
3
comment Finding all spanning trees of a strongly connected directed graph
What do you mean by "anchored at each vertex"? Any spanning tree will use each vertex.
Jan
10
awarded  Popular Question
Nov
9
awarded  Yearling