Timeline for Given a network flow find if there's a min cut that only one of the given edges lay on it

7 events

when toggle format	what		by	license	comment
Feb 1, 2020 at 13:34	vote	accept	BOB123
Jan 18, 2020 at 10:46	answer	added	xskxzr		timeline score: 3
Jan 18, 2020 at 10:43	history	edited	xskxzr	CC BY-SA 4.0	deleted 9 characters in body; edited tags
Jan 17, 2020 at 20:09	comment	added	BOB123		Think I solved it - Compute max flow. if both satisfy f(e) = c(e) then , lets increment by one capacity to edge e1. again find max flow, if we found and it's bigger by 1 then e1 will lay on every min-cut,so that's useful information we can do also on e2. then just need to check if both lay on every min-cut then we done, if not we can decrement by one the edge that we don't know yet if she even lay on any cut, and again find flow, if it reduced by one then it lay on some cut since the other edge lay on any cut then we found solution.
Jan 17, 2020 at 16:28	comment	added	BOB123		finding max flow, then I tried to prove that for example if both edges exist in the min-cut then it can't be that only one of them exists in another min-cut by assuming that there is such min-cut which means there is path to both vertices of one of the edges from s, but couldn't prove it, nor find contradiction...
Jan 17, 2020 at 16:25	comment	added	Anthony Labarre		What have you tried so far?
Jan 17, 2020 at 15:49	history	asked	BOB123	CC BY-SA 4.0