Assertion: graph's edge | /r/HasAspect | polynomial expansion
Facets:
value: more strongly
type: MANNER
Source sentences:
text: It follows that the biclique-free string graphs, string graphs containing no K t,t subgraph for some constant t, have O(n) edges and more strongly have polynomial expansion.