About: http://webisa.webdatacommons.org/230214322

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	Theorem: For every graph H, there is a finite set of graphs, say S(H), such that G contains H as a minor if and only if G contains some graph from S(H) as a topological minor.
http://www.w3.org/ns/prov#wasQuotedFrom	mathoverflow.net