Results 161 to 170 of about 1,483,849 (194)
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
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Anti-Ramsey number of matchings in a hypergraph
Discrete Mathematics, 2021Given hypergraphs $\mathcal H$ and $\mathcal G$, the anti-Ramsey number $AR(\mathcal H, \mathcal G)$ is the greatest integer $c$ such that no $c$-coloring of the edges of $\mathcal H$ admits a copy of $\mathcal G$ whose edges (using that coloring) are all of distinct colors.
Zemin Jin
exaly +2 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 problems for cycles
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiale Xu, Mei Lu, Ke Liu
openaire +1 more source
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
Combinatorica, 2002
The Turán number \(t_p(n)\) is the maximum size of a graph with \(n\) vertices without subgraphs isomorphic to the complete graph \(K_p\). A subgraph of \(K_n\) is called totally multicoloured (with respect to an edge colouring of \(K_n\)) if all edges have different colours. Let \(h_r(n)\) be the minimum number of colours so that any edge colouring of
Juan José Montellano-Ballesteros +1 more
openaire +1 more source
The Turán number \(t_p(n)\) is the maximum size of a graph with \(n\) vertices without subgraphs isomorphic to the complete graph \(K_p\). A subgraph of \(K_n\) is called totally multicoloured (with respect to an edge colouring of \(K_n\)) if all edges have different colours. Let \(h_r(n)\) be the minimum number of colours so that any edge colouring of
Juan José Montellano-Ballesteros +1 more
openaire +1 more source
An Anti-Ramsey Theorem on Cycles
Graphs and Combinatorics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan José Montellano-Ballesteros +1 more
openaire +2 more sources