Edge colourings of graphs avoiding monochromatic matchings of a given size
C Hoppen, Y Kohayakawa, H Lefmann - … , Probability and Computing, 2012 - cambridge.org
C Hoppen, Y Kohayakawa, H Lefmann
Combinatorics, Probability and Computing, 2012•cambridge.orgLet k and ℓ be positive integers. With a graph G, we associate the quantity ck, ℓ (G), the
number of k-colourings of the edge set of G with no monochromatic matching of size ℓ.
Consider the function ck, ℓ: given by ck, ℓ (n)= max {ck, ℓ (G):| V (G)|= n}, the maximum of ck,
ℓ (G) over all graphs G on n vertices. In this paper, we determine ck, ℓ (n) and the
corresponding extremal graphs for all large n and all fixed values of k and ℓ.
number of k-colourings of the edge set of G with no monochromatic matching of size ℓ.
Consider the function ck, ℓ: given by ck, ℓ (n)= max {ck, ℓ (G):| V (G)|= n}, the maximum of ck,
ℓ (G) over all graphs G on n vertices. In this paper, we determine ck, ℓ (n) and the
corresponding extremal graphs for all large n and all fixed values of k and ℓ.
Let k and ℓ be positive integers. With a graph G, we associate the quantity ck,ℓ(G), the number of k-colourings of the edge set of G with no monochromatic matching of size ℓ. Consider the function ck,ℓ: given by ck,ℓ(n) = max {ck,ℓ(G): |V(G)| = n}, the maximum of ck,ℓ(G) over all graphs G on n vertices. In this paper, we determine ck,ℓ(n) and the corresponding extremal graphs for all large n and all fixed values of k and ℓ.
Cambridge University Press以上显示的是最相近的搜索结果。 查看全部搜索结果