String graph: Difference between revisions

Revision as of 16:47, 4 March 2008

Revision as of 15:53, 5 March 2008

Line 5:

More formally, <math>G</math> is a string graph if and only if there exists some set of strings <math>S</math> such that the intersection graph

: <math>I = (\{ s | s \in S\}, \{(s,t) | s,t \in S \wedge s \cap t \not= \phivarnothing\})</math>

is isomorphic to <math>G</math>. We say that the size of a string graph is equal to the number of intersections, <math>|I|</math>.