Paper Info
Title
The maximum number of K3-free and K4-free edge 4-colorings.
Abstract
Let F(n, r, k) denote the maximum number of edge r-colorings without a monochromatic copy of K-k 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.
Year
DOI
Venue
2012
10.1112/jlms/jdr031
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES
Field
DocType
Volume
Topology,Graph,Monochromatic color,Combinatorics,Vertex (geometry),Mathematics
Journal
85
Issue
ISSN
Citations 
3
0024-6107
11
PageRank 
References 
Authors
1.05
0
2
Name
Order
Citations
PageRank
Oleg Pikhurko131847.03
Zelealem B. Yilma2325.32