108 reputation
4
bio website
location Riga, Republic of Latvia
age 23
visits member for 2 years, 9 months
seen Jul 16 at 12:25

Mar
19
comment Is a brute force method considered a proof?
@Cruncher Of course, that's why I said "brute forcing, not proof by exhaustion". Obviously you can't exhaust an infinite set. :)
Mar
19
comment Is a brute force method considered a proof?
To nitpick, it does work for infinite sets (brute forcing, not proof by exhaustion) if you only n0eed to prove existence.
May
20
comment For x < 5 what is the greatest value of x
Somehow the Berry paradox comes to mind...
Feb
4
awarded  Scholar
Feb
4
accepted Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
Feb
4
comment Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
Thanks, things about generating functions start to dawn up somewhere in the back of my head now, it's been a while since I took combinatorics. Thanks for the pointers.
Feb
4
comment Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
So, would the 2nd paragraph mean that the number of connected $d$-regular graphs is logarithmic of all $d$-regular graphs? This seems rather counter-intuitive, at least a quick Python script that I did produces results the other way around, and these two sequences say otherwise...
Feb
3
awarded  Supporter
Feb
3
comment Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
@GerryMyerson Yeah, relaxing this to $d$-regular graphs didn't help me much so I didn't bother and somehow started getting the idea that I've stumbled upon something messy. I'm guessing that getting the number of disconnected graphs won't be viable too...
Feb
3
comment Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
@RossMillikan Sorry 'bout that, I've been at this for too long I guess. You're right about the edges, it's just an undirected graph. Added some clarifications and explained the practical purpose in the last paragraph. The "sampling" esentially means that self-connections are allowed during construction but are discarded later.
Feb
3
revised Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
deleted 299 characters in body
Feb
3
awarded  Editor
Feb
3
revised Number of connected / disconnected / total graphs with V vertices of degree d or d - 1
deleted 299 characters in body
Feb
3
awarded  Student
Feb
3
asked Number of connected / disconnected / total graphs with V vertices of degree d or d - 1