Assertion: string graph | /r/MadeOf | no k t
Facets:
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.