About: Crossing number inequality

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices

Property Value
dbo:description
  • теорема про нижню межу мінімального числа схрещень графа як функцію числа ребер і вершин графа (uk)
  • theorem providing a lower bound to the crossing number; for sufficiently large graphs, the crossing number is not less than a constant times the cube of the number of edges divided by the square of the number of vertices (en)
  • teoremo pri suba baro de kruciĝonombro de grafo (eo)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Crossing number inequality (en)
  • Неравенство числа пересечений (ru)
  • Нерівність числа схрещень (uk)
  • 交叉數不等式 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:knownFor 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