bio | website | sites.google.com/site/rknmodn |
---|---|---|
location | Halifax, Canada | |
age | 32 | |
visits | member for | 4 years, 4 months |
seen | Jan 26 at 23:00 | |
stats | profile views | 1,667 |
This account is no longer in use.
Mar 31 |
awarded | Necromancer |
Dec 2 |
awarded | Yearling |
Oct 1 |
awarded | Caucus |
Sep 18 |
asked | Embedding points in 2D based on distance estimates? |
Aug 24 |
comment |
A question on graphic sequences
I think it's true for general graphs G. (Ah you're right... they'll end up with {0,..,0,m-1,m-1}.) |
Aug 24 |
comment |
A question on graphic sequences
Yes, I think it's now an interesting question as to which graphs result in a graphical $M_G$. The family above always have $M_G=\{0,0,\ldots,0,2,2\}$ which is very restricted. If I've done my arithmetic right, $\sum M_G$ is even, so it passes the most obvious test. |
Aug 23 |
revised |
A question on graphic sequences
added 89 characters in body |
Aug 23 |
revised |
A question on graphic sequences
added 401 characters in body |
Aug 23 |
revised |
A question on graphic sequences
deleted 16 characters in body |
Aug 23 |
answered | A question on graphic sequences |
Aug 6 |
awarded | Nice Question |
Jul 15 |
accepted | Force-directed graph drawing in 1D? |
Jul 9 |
asked | Force-directed graph drawing in 1D? |
Jun 25 |
comment |
Excluding linear size independent sets in graphs
When you say "linear size", what are the asymptotic conditions (e.g. is $k$ fixed and $n \rightarrow \infty$)? A greedy algorithm gives an independent set of size $\geq n/(k+1)$ in an $n$-vertex $k$-regular graph. |
Jun 25 |
comment |
Proving that the set of $\lfloor n/3 \rfloor+1$ partial Latin squares given by Pebody is unavoidable?
Thanks Willie Wong! I've been wondering if MathOverflow would upgrade before the 60-day migration time limit was up. |
Jun 25 |
revised |
Proving that the set of $\lfloor n/3 \rfloor+1$ partial Latin squares given by Pebody is unavoidable?
added 274 characters in body |
Jun 25 |
reviewed | Reviewed Graduate Schools for Graph Theory |
Jun 25 |
reviewed | Reviewed Random graphs require O(n log(n)) edges until they are almost certainly fully connected - what are more concrete boundaries ? |
Jun 25 |
reviewed | Reviewed Statistics on partitions equidistributed with number of even parts |
Jun 25 |
awarded | Informed |