The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while the exponent is the difference between |V| and n. We also state three conjectures on the number of graphs that have fixed number of vertices |V| and chromatic number n.
7 pages, submitted for journal publication
7 pages, submitted for journal publication