ramgorur
Reputation
Next privilege 250 Rep.
 Feb22 accepted Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? Feb22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? gulp, have you just broke a record? Ellingham-Horton graph has 54 vertices and wiki says it's the lowest! Feb22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? @LaarsHelenius yes. Feb22 comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? @Casteels It's corrected, the graph is connected. Feb22 revised Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? added 106 characters in body; edited title Feb22 asked Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle? Feb21 accepted Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. Feb21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. now it explains a lot, thanks. Feb21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. ok, lets say we have an edge cut $C$ that contains a smaller edge cut $C'$, and suppose $C'$ does not contain any smaller edge cut anymore. So, $C'$ is minimal, then why we are not calling $C'$ as "minimum" (instead of minimal)? Feb21 comment Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. could you please elaborate a bit more on "does not contain a smaller edge cut"? the only way to isolate a single vertex is to have a cut over all the edges connected to it, so why are we saying it as "minimal"? this is the only "cut" that we have and it's "minimum". Feb21 revised Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. deleted 5 characters in body Feb21 asked Prove that every minimal edge cut in a simple connected graph $G(V,E)$ is even, then $G(V,E)$ has no odd degree vertex. Sep24 awarded Autobiographer Sep16 revised compute the bisecting normal hyperplane between two $n$-dimensional points. added 14 characters in body Sep16 comment compute the bisecting normal hyperplane between two $n$-dimensional points. what do you mean by $\mathbf{x_2} - \mathbf{x_2}$? Sep16 revised compute the bisecting normal hyperplane between two $n$-dimensional points. edited tags Sep16 revised compute the bisecting normal hyperplane between two $n$-dimensional points. added 906 characters in body; edited tags; edited title Sep16 revised compute the bisecting normal hyperplane between two $n$-dimensional points. edited body Sep16 asked compute the bisecting normal hyperplane between two $n$-dimensional points. Nov29 awarded Scholar