No label defined (Q4729807)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4114659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4114659 |
Statements
1988
0 references
proper vertex colouring
0 references
chromatic polynomial
0 references
0.8855595588684082
0 references
0.8715149164199829
0 references
0.8561165928840637
0 references
0.8428691029548645
0 references
[For the entire collection see Zbl 0665.00002.] A finite simple undirected graph G on v vertices having e edges is called a (v,e)-graph. A proper \(\lambda\)-colouring of G is a mapping from the vertex set of G onto a set \(\{\) 1,2,...,\(\lambda\) \(\}\) of colours such that no two adjacent vertices have the same colour. Let P(\(\lambda\),G) denote the number of proper \(\lambda\)-colourings of G and f(v,e,\(\lambda)\) the largest number of proper colourings in at most \(\lambda\) colours a (v,e)-graph can have. This paper contains some results on lower and upper bounds of f(v,e,\(\lambda)\) and the main ideas of their proofs. Moreover, a connection between the problem to find graphs G with \(P(\lambda,G)=f(v,e,\lambda)\) and the number of triangles in a graph is considered. Relations to other problems of extremal graph theory are stated.
0 references