News for hackers. Stuff that matters.

A comment on Inverting Gauss’ Formula. Parent comment

Re:Inverting Gauss’ Formula by a_e_k on Tuesday August 22, 2023 @06:09PM (#37229211)
I assume that's only possible in the general case for an odd number of vertices?

A fully connected graph with an even number of vertices will have odd degrees for all of them, and so can't have an Eulerian path.

[ Parent | on HN ]
Re:Inverting Gauss’ Formula by hgsgm on Tuesday August 22, 2023 @07:49PM (#37230087)
/r/2IsNotEven
[ Parent | on HN ]
Re:Inverting Gauss’ Formula by phalf on Wednesday August 23, 2023 @11:42AM (#37237780)
I could be mixing things up here, it's been too long ago. I think this was about a directed graph, so the number of edges is actually N^2 and your walk roughly of that length.
[ Parent | on HN ]