The Library
The maximum number of K3-free and K4-free edge 4-colorings
Tools
Tools
Tools
Pikhurko, Oleg and Yilma, Z. B. (2012) The maximum number of K3-free and K4-free edge 4-colorings. Journal of the London Mathematical Society, Vol.83 (No.3). pp. 593-615. doi:10.1112/jlms/jdr031 ISSN 0024-6107.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1112/jlms/jdr031
Abstract
Let F(n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of Kk that a graph with n vertices can have. Addressing two questions left open by Alon, Balogh, Keevash and Sudakov [J. London Math. Soc. 70 (2004) 273–288], we determine F(n, 4, 3) and F(n, 4, 4) and describe the extremal graphs for all large n.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
| Journal or Publication Title: | Journal of the London Mathematical Society | ||||
| Publisher: | Cambridge University Press | ||||
| ISSN: | 0024-6107 | ||||
| Official Date: | June 2012 | ||||
| Dates: |
|
||||
| Volume: | Vol.83 | ||||
| Number: | No.3 | ||||
| Number of Pages: | 23 | ||||
| Page Range: | pp. 593-615 | ||||
| DOI: | 10.1112/jlms/jdr031 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Funder: | National Science Foundation, Alexander von Humboldt Foundation | ||||
| Grant number: | DMS-0758057 |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
