Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Albertson_conjecture> ?p ?o }
Showing triples 1 to 53 of
53
with 100 triples per page.
- Albertson_conjecture abstract "In combinatorial mathematics, the Albertson conjecture is an unproven relationship between the crossing number and the chromatic number of a graph. It is named after Michael O. Albertson, a professor at Smith College, who stated it as a conjecture in 2007; it is one of his many conjectures in graph coloring theory. The conjecture states that, among all graphs requiring n colors, the complete graph Kn is the one with the smallest crossing number.Equivalently, if a graph can be drawn with fewer crossings than Kn, then, according to the conjecture, it may be colored with fewer than n colors.".
- Albertson_conjecture wikiPageExternalLink v17i1r73.html.
- Albertson_conjecture wikiPageExternalLink v21i1p57.
- Albertson_conjecture wikiPageID "24205238".
- Albertson_conjecture wikiPageLength "7892".
- Albertson_conjecture wikiPageOutDegree "22".
- Albertson_conjecture wikiPageRevisionID "607152242".
- Albertson_conjecture wikiPageWikiLink Category:Conjectures.
- Albertson_conjecture wikiPageWikiLink Category:Graph_coloring.
- Albertson_conjecture wikiPageWikiLink Category:Topological_graph_theory.
- Albertson_conjecture wikiPageWikiLink Chromatic_number.
- Albertson_conjecture wikiPageWikiLink Clique_(graph_theory).
- Albertson_conjecture wikiPageWikiLink Combinatorica.
- Albertson_conjecture wikiPageWikiLink Combinatorics.
- Albertson_conjecture wikiPageWikiLink Complete_graph.
- Albertson_conjecture wikiPageWikiLink Crossing_number_(graph_theory).
- Albertson_conjecture wikiPageWikiLink Four_color_theorem.
- Albertson_conjecture wikiPageWikiLink Graph_(mathematics).
- Albertson_conjecture wikiPageWikiLink Graph_coloring.
- Albertson_conjecture wikiPageWikiLink Graph_minor.
- Albertson_conjecture wikiPageWikiLink Greedy_coloring.
- Albertson_conjecture wikiPageWikiLink György_Hajós.
- Albertson_conjecture wikiPageWikiLink Hadwiger_conjecture_(graph_theory).
- Albertson_conjecture wikiPageWikiLink Homeomorphism_(graph_theory).
- Albertson_conjecture wikiPageWikiLink Mathematics.
- Albertson_conjecture wikiPageWikiLink Planar_graph.
- Albertson_conjecture wikiPageWikiLink Smith_College.
- Albertson_conjecture wikiPageWikiLink Vacuous_truth.
- Albertson_conjecture wikiPageWikiLinkText "Albertson conjecture".
- Albertson_conjecture authorlink "Richard K. Guy".
- Albertson_conjecture first "Richard K.".
- Albertson_conjecture hasPhotoCollection Albertson_conjecture.
- Albertson_conjecture last "Guy".
- Albertson_conjecture wikiPageUsesTemplate Template:Citation.
- Albertson_conjecture wikiPageUsesTemplate Template:Harvs.
- Albertson_conjecture wikiPageUsesTemplate Template:Harvtxt.
- Albertson_conjecture wikiPageUsesTemplate Template:Reflist.
- Albertson_conjecture year "1972".
- Albertson_conjecture subject Category:Conjectures.
- Albertson_conjecture subject Category:Graph_coloring.
- Albertson_conjecture subject Category:Topological_graph_theory.
- Albertson_conjecture hypernym Relationship.
- Albertson_conjecture type Person.
- Albertson_conjecture type Conjecture.
- Albertson_conjecture type Statement.
- Albertson_conjecture type Statement.
- Albertson_conjecture comment "In combinatorial mathematics, the Albertson conjecture is an unproven relationship between the crossing number and the chromatic number of a graph. It is named after Michael O. Albertson, a professor at Smith College, who stated it as a conjecture in 2007; it is one of his many conjectures in graph coloring theory.".
- Albertson_conjecture label "Albertson conjecture".
- Albertson_conjecture sameAs m.07kjpwn.
- Albertson_conjecture sameAs Q4712279.
- Albertson_conjecture sameAs Q4712279.
- Albertson_conjecture wasDerivedFrom Albertson_conjecture?oldid=607152242.
- Albertson_conjecture isPrimaryTopicOf Albertson_conjecture.