Re: Directed graph connectedness - simple?

Victor Porton wrote:
I've found myself already several hours attempting
to prove seemingly obvious statement:

A directed graph (Vertices,Edges) is connected
if and only if
$(A\times B)\cap Edges \ne \emptyset$
for any two nonempty sets $A$ and $B$ such that
$A\cup B\supseteq Vertices$.

Could you describe your problem using non-latex syntax. I have no idea
what the statement is.

--
Bernd

.

Relevant Pages

  • Re: Directed graph connectedness - simple?
    ... Could you describe your problem using non-latex syntax. ... A directed graph is strongly connected ... for any two nonempty sets of vertices A and B such that ... set theoretic union of A and B is a superset of Vertices. ...
    (sci.math)
  • Re: Directed graph connectedness - simple?
    ... Victor Porton wrote: ... A directed graph is connected ... I'm especially interested in the reverse implication. ...
    (sci.math)
  • Re: Directed graph connectedness - simple?
    ... Victor Porton wrote: ... A directed graph is connected ... I'm especially interested in the reverse implication. ...
    (sci.math)
  • Re: Directed graph connectedness - simple?
    ... Victor Porton wrote: ... I'm especially interested in the reverse implication. ... Let 1 denote the directed graph with exactly one vertex and one loop ...
    (sci.math)
  • Re: Directed graph connectedness - simple?
    ... A directed graph is strongly connected if and only ... if there are one or more arrows from A to B for any two nonempty sets ... If A and B are vertices, the only way for the union ... of A and B to be a superset of ...
    (sci.math)