Results 1 to 10 of about 102 (83)
Anti-Ramsey Hypergraph Numbers [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The anti-Ramsey number arn(H) of an r-uniform hypergraph is the maximum number of colors that can be used to color the hyperedges of a complete r-uniform hypergraph on n vertices without producing a rainbow copy of H.
Mark Budden, William Stiles
doaj +2 more sources
On the anti-Ramsey number of forests [PDF]
Discrete Applied Mathematics, 2021 18 pages, 1 ...
Chunqiu Fang, Ervin Gyori, Mei Lu
exaly +4 more sources
Anti-Ramsey Number of Hanoi Graphs
Discussiones Mathematicae Graph Theory, 2019 Let ar(G,H) be the largest number of colors such that there exists an edge coloring of G with ar(G,H) colors such that each subgraph isomorphic to H has at least two edges in the same color. We call ar(G,H) the anti- Ramsey number for a pair of graphs (G,
Gorgol Izolda, Lechowska Anna
doaj +3 more sources
On the anti-Ramsey numbers of linear forests [PDF]
Discrete Mathematics, 2020 For a fixed graph $F$, the $\textit{anti-Ramsey number}$, $AR(n,F)$, is the maximum number of colors in an edge-coloring of $K_n$ which does not contain a rainbow copy of $F$. In this paper, we determine the exact value of anti-Ramsey numbers of linear forests for sufficiently large $n$, and show the extremal edge-colored graphs.
Tian-Ying Xie, Long-Tu Yuan
exaly +4 more sources
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph $\mathcal{H}$, $ar(n,s, \mathcal{H})$, is the smallest integer $c$ such that in any coloring of the edges of the $s$-uniform complete hypergraph on $n$ vertices with exactly $c$ colors, there is a copy of $\mathcal{H}$ whose edges have ...
Ran Gu, Jiaao Li, Yongtang Shi
exaly +3 more sources
Anti-Ramsey numbers for vertex-disjoint triangles
Discrete Mathematics, 2023 An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of K_{n} with no rainbow copy of G. Denote by kC_{3} the union of k vertex-disjoint copies of C_{3}. In this paper, we determine the anti-Ramsey
Shenggui Zhang +2 more
exaly +3 more sources
Anti-Ramsey numbers for disjoint copies of graphs [PDF]
Opuscula Mathematica, 2017 A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph \(G\) and a positive integer \(n\), the anti-Ramsey number \(ar(n,G)\) is the maximum number of colors in an edge-coloring of \(K_n\) with no ...
Izolda Gorgol, Agnieszka Görlich
doaj +2 more sources
Anti-Ramsey number of matchings in hypergraphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lâle Özkahya, Michael Young
exaly +3 more sources
Anti-Ramsey numbers in complete split graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Izolda Gorgol
exaly +2 more sources
Size and Degree Anti-Ramsey Numbers [PDF]
Graphs and Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gang Chen, Yongxin Lan, Zi-Xia Song
+10 more sources