Results 141 to 143 of about 7,928 (143)
Some of the next articles are maybe not open access.
Anti‐Ramsey numbers of doubly edge‐critical graphs
Journal of Graph Theory, 2009AbstractGiven a graph H and a positive integer n, Anti‐Ramsey number AR(n, H) is the maximum number of colors in an edge‐coloring of Kn that contains no polychromatic copy of H. The anti‐Ramsey numbers were introduced in the 1970s by Erdős, Simonovits, and Sós, who among other things, determined this function for cliques.
Jiang, Tao, Pikhurko, Oleg
openaire +1 more source
Anti-Ramsey problems on graphs and hypergraphs
The Tur\'{a}n number for a graph $H$ is the least possible number of edges on an $n$-vertex graph with no copy of $H$ as a subgraph. For graphs $G$ and $H$, the \emph{anti-Ramsey number}, denoted $\ar(G,H)$, is the minimum number of colors $d$ such that for any edge coloring with $d$ colors there exists a rainbow copy of $H$. The concept of anti-Ramseyopenaire +2 more sources