About: Goldberg–Seymour conjecture

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

In graph theory the Goldberg–Seymour conjecture states that where is the edge chromatic number of G and Note this above quantity is twice the arboricity of G. It is sometimes called the density of G. Above G can be a multigraph (can have loops).

Property Value
dbo:abstract
  • In graph theory the Goldberg–Seymour conjecture states that where is the edge chromatic number of G and Note this above quantity is twice the arboricity of G. It is sometimes called the density of G. Above G can be a multigraph (can have loops). (en)
dbo:wikiPageID
  • 31056132 (xsd:integer)
dbo:wikiPageLength
  • 2570 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1117774827 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In graph theory the Goldberg–Seymour conjecture states that where is the edge chromatic number of G and Note this above quantity is twice the arboricity of G. It is sometimes called the density of G. Above G can be a multigraph (can have loops). (en)
rdfs:label
  • Goldberg–Seymour conjecture (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
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy