4 papers
Anti-Ramsey Number of Stars in 3-uniform hypergraphs
Hongliang Lu, Xinyue Luo, Xinxin Ma
An edge-colored hypergraph is called \emph{a rainbow hypergraph} if all the colors on its edges are distinct. Given two positive integers and an -uniform hypergraph $\math…
Anti-Ramsey number of intersecting cliques
Hongliang Lu, Xinyue Luo, Xinxin Ma
An edge-colored graph is called a rainbow graph if all its edges have distinct colors. The anti-Ramsey number , for a graph and a positive integer , is defined as…
New Bounds on the Anti-Ramsey Number of Independent Triangles
Hongliang Lu, Xinyue Luo, Xinxin Ma
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. Given a positive integer and a graph , the \textit{anti-Ramsey number} $a…
Anti-Ramsey Number of Friendship Graphs
Wenke Liu, Hongliang Lu, Xinyue Luo
An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. For a given positive integer and a family of graphs , the anti-…