Journal article
The t-improper chromatic number of random graphs
- Abstract:
- We consider the $t$-improper chromatic number of the Erd{\H o}s-R{\'e}nyi random graph $G(n,p)$. The t-improper chromatic number $\chi^t(G)$ of $G$ is the smallest number of colours needed in a colouring of the vertices in which each colour class induces a subgraph of maximum degree at most $t$. If $t = 0$, then this is the usual notion of proper colouring. When the edge probability $p$ is constant, we provide a detailed description of the asymptotic behaviour of $\chi^t(G(n,p))$ over the range of choices for the growth of $t = t(n)$.
Actions
Access Document
- Publisher copy:
- 10.1017/S0963548309990216
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- Combin. Probab. Comput. 19 (2010), 87-98
- Volume:
- 19
- Issue:
- SPEC. ISS.
- Pages:
- 87-98
- Publication date:
- 2008-09-26
- DOI:
- EISSN:
-
1571-0653
- ISSN:
-
1571-0653
- URN:
-
uuid:4837fb8d-c30a-4a88-96a0-fb2993fee6a8
- Source identifiers:
-
97474
- Local pid:
- pubs:97474
Item Description
- Language:
- English
- Keywords:
Terms of use
- Copyright date:
- 2008
- Notes:
- 12 pages
If you are the owner of this record, you can report an update to it here: Report update to this record