Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Symmetric_hypergraph_theorem> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Symmetric_hypergraph_theorem 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.".
- Symmetric_hypergraph_theorem wikiPageID "5514192".
- Symmetric_hypergraph_theorem wikiPageLength "1616".
- Symmetric_hypergraph_theorem wikiPageOutDegree "15".
- Symmetric_hypergraph_theorem wikiPageRevisionID "659112160".
- Symmetric_hypergraph_theorem wikiPageWikiLink Automorphism.
- Symmetric_hypergraph_theorem wikiPageWikiLink Automorphism_group.
- Symmetric_hypergraph_theorem wikiPageWikiLink Category:Graph_coloring.
- Symmetric_hypergraph_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
- Symmetric_hypergraph_theorem wikiPageWikiLink Combinatorics.
- Symmetric_hypergraph_theorem wikiPageWikiLink Folklore.
- Symmetric_hypergraph_theorem wikiPageWikiLink Glossary_of_graph_theory.
- Symmetric_hypergraph_theorem wikiPageWikiLink Graph_(mathematics).
- Symmetric_hypergraph_theorem wikiPageWikiLink Graph_Ramsey_theory.
- Symmetric_hypergraph_theorem wikiPageWikiLink Graph_coloring.
- Symmetric_hypergraph_theorem wikiPageWikiLink Group_(mathematics).
- Symmetric_hypergraph_theorem wikiPageWikiLink Group_action.
- Symmetric_hypergraph_theorem wikiPageWikiLink Hypergraph.
- Symmetric_hypergraph_theorem wikiPageWikiLink Ramsey_theory.
- Symmetric_hypergraph_theorem wikiPageWikiLinkText "Symmetric hypergraph theorem".
- Symmetric_hypergraph_theorem hasPhotoCollection Symmetric_hypergraph_theorem.
- Symmetric_hypergraph_theorem subject Category:Graph_coloring.
- Symmetric_hypergraph_theorem subject Category:Theorems_in_graph_theory.
- Symmetric_hypergraph_theorem hypernym Theorem.
- Symmetric_hypergraph_theorem type Theorem.
- Symmetric_hypergraph_theorem 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.".
- Symmetric_hypergraph_theorem label "Symmetric hypergraph theorem".
- Symmetric_hypergraph_theorem sameAs m.0dqb5m.
- Symmetric_hypergraph_theorem sameAs Q7661308.
- Symmetric_hypergraph_theorem sameAs Q7661308.
- Symmetric_hypergraph_theorem wasDerivedFrom Symmetric_hypergraph_theorem?oldid=659112160.
- Symmetric_hypergraph_theorem isPrimaryTopicOf Symmetric_hypergraph_theorem.