About: Symmetric hypergraph theorem

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

The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore.

Property Value
dbo:abstract
  • The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore. (en)
dbo:wikiPageID
  • 5514192 (xsd:integer)
dbo:wikiPageLength
  • 1674 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1119073196 (xsd:integer)
dbo:wikiPageWikiLink
dct:subject
gold:hypernym
rdf:type
rdfs:comment
  • The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore. (en)
rdfs:label
  • Symmetric hypergraph theorem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
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