1,629 reputation
823
bio website
location
age 26
visits member for 3 years, 10 months
seen 32 mins ago

If you have any good math exercises to share feel free to contribute them on http://exwiki.org


Aug
14
revised Gallai & Milgram path covers theorem from Diestel
added 1 character in body
Aug
14
asked Gallai & Milgram path covers theorem from Diestel
Jul
23
comment Graph containing every trees of size $n$ as subgraphs
@manuellafond It was presented by Szemerédi at the Erdos conference last year.
Jul
22
answered Graph containing every trees of size $n$ as subgraphs
Jul
16
revised Chromatic number of generalized hypercube
added 216 characters in body
Jul
16
revised Chromatic number of generalized hypercube
added 299 characters in body
Jul
16
answered Chromatic number of generalized hypercube
Jul
10
awarded  Civic Duty
Jul
2
awarded  Curious
Jul
2
awarded  Inquisitive
Jun
30
awarded  Notable Question
Jun
29
comment Complexity of counting the number of triangles of a graph
@EricTowers No. It even turns out that a faster triangle counting algorithm would result in a faster matrix multiplication algorithm!
Jun
24
asked Constructing an eigenvector for a certain matrix representing a graph with a perfect code
May
29
accepted $n^n$ cannot be expressed as a recurrence with polynomial coefficents
May
28
comment $n^n$ cannot be expressed as a recurrence with polynomial coefficents
@vadim123 Hm.. I don't see how may I use that. Could you explain a bit more?
May
27
asked $n^n$ cannot be expressed as a recurrence with polynomial coefficents
May
27
comment number of symmetries of an arbitrary graph
Then I suppose it would be good if you could describe your graphs by a formal construction.
May
27
comment number of symmetries of an arbitrary graph
If you're dealing with concrete graphs then you can use the program nauty to compute the automorphism group. If you are dealing with a specific class of graphs then maybe you can prove they have some automorphisms by the way you construct them.
May
15
comment Eigenvalues of the distance-k graph of a graph
@jamisans It appears that the distance graphs of the graphs you are studying are vertex transitive, hence (after showing this) you could apply the same argument as done on MO for $G_{n,k}.$
May
13
answered Why must a triangle-free 4-chromatic graph have at least 11 vertices?