About: Turán number

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

In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k vertices contains an edge. This number was determined for r = 2 by , and the problem for general r was introduced in . The paper gives a survey of Turán numbers.

Property Value
dbo:abstract
  • In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k vertices contains an edge. This number was determined for r = 2 by , and the problem for general r was introduced in . The paper gives a survey of Turán numbers. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 14982946 (xsd:integer)
dbo:wikiPageLength
  • 2666 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1041218441 (xsd:integer)
dbo:wikiPageWikiLink
dbp:first
  • A. P. (en)
dbp:last
  • Godbole (en)
dbp:title
  • Turán number (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k vertices contains an edge. This number was determined for r = 2 by , and the problem for general r was introduced in . The paper gives a survey of Turán numbers. (en)
rdfs:label
  • Turán number (en)
owl:sameAs
prov:wasDerivedFrom
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 3.0 Unported License