2003/10/31 by Kamil Kulesza, Kulesza, Kamil, Zbigniew Kotulski +1
Computer Science · Mathematics · #05C15 #05C30 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #math.CO #msc:05C15 #msc:05C30
paper · pdf · doi:10.48550/arxiv.math/0310485
7 pages, submitted for journal publication
openalex publication_date 2003/10/31 · arxiv created 2003/11/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.