DFS and c-Expander graph - simple path with the length of n-2c+1

Asked Apr 02 '13 at 06:20

Active Apr 03 '13 at 19:17

Viewed 158 times

Just to make it clear - c-Expander graph is a directed graph G(V,E) with 2 Disjoint sets (A and B), of size equal or more than c with at least one Vertex between node of A and node of B.

I have to prove there is a simple directed path of length n-2c+1 in that graph.

Any Ideas?

(A tip I got - prove that when running DFS there is a stage the number of the Black nodes are equals to the number of the White nodes, where BLACK nodes are nodes we finished working on, and WHITE nodes are nodes we haven't started working on)

edited Apr 03 '13 at 19:17

asked Apr 02 '13 at 06:20

SharonBL

1,735
5
20
28

Since this is more of a theory question, this might be a better fit at cs.stackexchange.com or cstheory.stackexchange.com. – templatetypedef Apr 03 '13 at 18:42
Tried it out now - i cross my fingers :-) – SharonBL Apr 03 '13 at 19:20

DFS and c-Expander graph - simple path with the length of n-2c+1

0 Answers0