The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors
| dc.creator | Kulesza, Kamil | |
| dc.creator | Kotulski, Zbigniew | |
| dc.date | 2003-10-31 | |
| dc.date | 2003-11-25 | |
| dc.date.accessioned | 2026-07-07T05:02:24Z | |
| dc.date.available | 2026-07-07T05:02:24Z | |
| dc.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. | |
| dc.description | 7 pages, submitted for journal publication | |
| dc.identifier | https://arxiv.org/abs/math/0310485 | |
| dc.identifier | http://arxiv.org/abs/math/0310485 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69035 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 ; 05C30 | |
| dc.title | The upper bound on number of graphs, with fixed number of vertices, that vertices can be colored with n colors | |
| dc.type | text |