On anti-Ramsey numbers for complete bipartite graphs and the Turan function

Details On anti-Ramsey numbers for complete bipartite graphs and the Turan function On anti-Ramsey numbers for complete bipartite graphs and the Turan function

2011-08-25

arxiv.org/abs/1108.5204v1

Mathematics

Combinatorics

4 pages

Scientific paper

Given two graphs $G$ and $H$ with $H\subseteq G$ we consider the anti-Ramsey function $AR(G,H)$ which is the maximum number of colors in any edge-coloring of $G$ so that every copy of $H$ receives the same color on at least one pair of edges. The classical Tur\'an function for a graph $G$ and family of graphs $\mathcal{F}$, written $ex(G,\mathcal{F})$, is defined as the maximum number of edges of a subgraph of $G$ not containing any member of $\mathcal{F}$. We show that there exists a constant $c>0$ so that $AR(K_n,K_{s,t})-ex(K_n,K_{s,t})

Affiliated with

Also associated with

No associations

Rating

On anti-Ramsey numbers for complete bipartite graphs and the Turan function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On anti-Ramsey numbers for complete bipartite graphs and the Turan function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On anti-Ramsey numbers for complete bipartite graphs and the Turan function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501385