On the asymptotic value of the choice number of complete multi‐partite graphs (Q5471010): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2951825534 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0409134 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Choice Numbers of Graphs: a Probabilistic Approach / rank | |||
Normal rank | |||
Latest revision as of 16:33, 24 June 2024
scientific article; zbMATH DE number 5029869
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the asymptotic value of the choice number of complete multi‐partite graphs |
scientific article; zbMATH DE number 5029869 |
Statements
On the asymptotic value of the choice number of complete multi‐partite graphs (English)
0 references
6 June 2006
0 references
complete bipartite graph
0 references
list-chromatic number
0 references
