At 10:04 PM 12/16/2014, Jon Awbrey wrote:
In the best mathematical terms, a triadic relation is a cartesian product of three sets together with a specified subset of that cartesian product.
I know that. My question was: Is there a graph theory representation of a triadic relation that does not have a dyadic subgraph? If so, I was just looking for a simple example.
Howard
----------------------------- PEIRCE-L subscribers: Click on "Reply List" or "Reply All" to REPLY ON PEIRCE-L to this message. PEIRCE-L posts should go to [email protected] . To UNSUBSCRIBE, send a message not to PEIRCE-L but to [email protected] with the line "UNSubscribe PEIRCE-L" in the BODY of the message. More at http://www.cspeirce.com/peirce-l/peirce-l.htm .
