Comments on: Circuits in Complete Graphs and the Dwyer Function http://arbib.it/2008/05/30/circuits-in-complete-graphs-and-the-dwyer-function-2/ Mzee mulimu; A bit of my work, life, and experiences. Sun, 18 Dec 2011 03:49:30 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: ac3bf1 http://arbib.it/2008/05/30/circuits-in-complete-graphs-and-the-dwyer-function-2/comment-page-1/#comment-1988 ac3bf1 Tue, 28 Jun 2011 07:23:46 +0000 http://arbib.it/?p=533#comment-1988 Hey Cam, first of all, thanks for the comment, second, I have forwarded this message to Prof Dwyer who might reply. If he does I'll email you with what he says :-) Jonathan Hey Cam, first of all, thanks for the comment, second, I have forwarded this message to Prof Dwyer who might reply. If he does I’ll email you with what he says :-)

Jonathan

]]> By: Cam http://arbib.it/2008/05/30/circuits-in-complete-graphs-and-the-dwyer-function-2/comment-page-1/#comment-1984 Cam Fri, 24 Jun 2011 18:56:29 +0000 http://arbib.it/?p=533#comment-1984 I'm interested in your paper with Prof. Dwyer. Unfortunately the paper mentioned above does not prove, nor does it provide citations, for two crucial results. Is there somewhere in the literature that I can look for a proof of formulae 16 and 17? For fun I was trying to count the number of ways you can make cycles out of sets of dominoes, and the general problem is equivalent to counting eulerian cycles in complete graphs. Thanks! I’m interested in your paper with Prof. Dwyer. Unfortunately the paper mentioned above does not prove, nor does it provide citations, for two crucial results. Is there somewhere in the literature that I can look for a proof of formulae 16 and 17?

For fun I was trying to count the number of ways you can make cycles out of sets of dominoes, and the general problem is equivalent to counting eulerian cycles in complete graphs.

Thanks!

]]>