# Complexity of Computing the Anti-Ramsey Numbers for Paths

@inproceedings{Amiri2020ComplexityOC,
title={Complexity of Computing the Anti-Ramsey Numbers for Paths},
author={S. Amiri and Alexandru Popa and M. Roghani and Golnoosh Shahkarami and R. Soltani and H. Vahidi},
booktitle={MFCS},
year={2020}
}
• S. Amiri, +3 authors H. Vahidi
• Published in MFCS 2020
• Mathematics, Computer Science
• The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the \emph{anti-Ramsey number} $\textrm{ar}(G,H)$ is defined to be the maximum number $k$ such that there exists an assignment of $k$ colors to the edges of $G$ in which every copy of $H$ in $G$ has at least two edges with the same color. There are works on the computational complexity of the problem when $H$ is a star. Along this line of… CONTINUE READING

#### References

SHOWING 1-10 OF 30 REFERENCES
Anti-Ramsey Numbers for Graphs with Independent Cycles
• Mathematics, Computer Science
• Electron. J. Comb.
• 2009
• 23
• PDF
Anti-Ramsey Numbers of Subdivided Graphs
• T. Jiang
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2002
• 31
• PDF
The anti-Ramsey number of perfect matching
• Computer Science, Mathematics
• Discret. Math.
• 2012
• 35
• PDF
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
• Mathematics, Computer Science
• 2009 24th Annual IEEE Conference on Computational Complexity
• 2009
• 51
• PDF
Bipartite rainbow numbers of matchings
• Computer Science, Mathematics
• Discret. Math.
• 2009
• 26
• PDF
Anti-Ramsey Colorings in Several Rounds
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2001
• 11
• PDF
Edge-colorings of complete graphs that avoid polychromatic trees
• Computer Science, Mathematics
• Discret. Math.
• 2004
• 54
• PDF
An Anti-Ramsey Theorem on Cycles
• Mathematics, Computer Science
• Graphs Comb.
• 2005
• 63
Rainbow numbers for matchings and complete graphs
• 65
• PDF