Home > Papers

 
 
Bounds for anti-Ramsey number of single tree
Chunyan Duan * #
School of science, China University of Mining and Technology
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:18 January 2008
Accepted by: none
Citation: Chunyan Duan.Bounds for anti-Ramsey number of single tree[OL]. [18 January 2008] http://en.paper.edu.cn/en_releasepaper/content/18187
 
 
Given a positive integer n and a family F of graphs, let R(n,F) denote the maximum number of colors in an edge-coloring of complete graph such that no subgraph of complete graph belonging to F has distinct colors on its edges. In this paper, we obtain bounds on single tree , where the single tree with s+t edges obtained by identifying a leaf of star with an endpoint of path .
Keywords:Anti-Ramsey number; Edge-coloring; Rainbow
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 211
Bookmarked 0
Recommend 5
Comments Array
Submit your papers