About: Graph removal lemma

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Lemma that when a graph contains few copies of a given subgraph, then all of the copies can be eliminated by removing a small number of edges

thumbnail
Property Value
dbo:description
  • lemma that when a graph contains few copies of a given subgraph, then all of the copies can be eliminated by removing a small number of edges (en)
  • твердження, що якщо граф містить кілька копій даного підграфа, всі його копії можна виключити видаливши мале число ребер (uk)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Graph removal lemma (en)
  • Лема про видалення графа (uk)
  • Лемма об удалении графа (ru)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International