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. ISSN 0024-6107
Full text not available from this repository.
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 > Mathematics |
| Journal or Publication Title: | Journal of the London Mathematical Society |
| Publisher: | Cambridge University Press |
| ISSN: | 0024-6107 |
| Date: | June 2012 |
| Volume: | Vol.83 |
| Number: | No.3 |
| Number of Pages: | 23 |
| Page Range: | pp. 593-615 |
| Identification Number: | 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 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/43839 |
Actions (login required)
 |
View Item |
