Reputation
Next privilege 250 Rep.
View close votes
Badges
6
Impact
~288 people reached

Feb
22
accepted Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?
Feb
22
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!
Feb
22
comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?
@LaarsHelenius yes.
Feb
22
comment Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?
@Casteels It's corrected, the graph is connected.
Feb
22
revised Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?
added 106 characters in body; edited title
Feb
22
asked Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?
Feb
21
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.
Feb
21
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.
Feb
21
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)?
Feb
21
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".
Feb
21
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
Feb
21
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.
Sep
24
awarded  Autobiographer
Sep
16
revised compute the bisecting normal hyperplane between two $n$-dimensional points.
added 14 characters in body
Sep
16
comment compute the bisecting normal hyperplane between two $n$-dimensional points.
what do you mean by $\mathbf{x_2} - \mathbf{x_2}$?
Sep
16
revised compute the bisecting normal hyperplane between two $n$-dimensional points.
edited tags
Sep
16
revised compute the bisecting normal hyperplane between two $n$-dimensional points.
added 906 characters in body; edited tags; edited title
Sep
16
revised compute the bisecting normal hyperplane between two $n$-dimensional points.
edited body
Sep
16
asked compute the bisecting normal hyperplane between two $n$-dimensional points.
Nov
29
awarded  Scholar