Search
Now showing items 1-1 of 1
Improved approximation bounds on maximum edge q coloring of dense graphs
The anti-Ramsey number ar(G,H) with input graph G and pattern graph H, is the maximum
positive integer k such that there exists an edge coloring of G using k colors, in which there are
no rainbow subgraphs isomorphic to ...