Results 101 to 110 of about 120,363 (120)
Some of the next articles are maybe not open access.
Anti-Ramsey numbers for cycles in the generalized Petersen graphs
Applied Mathematics and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqing Liu, Mei Lu, Shunzhe Zhang
exaly +2 more sources
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.
Oleg Pikhurko
exaly +2 more sources
Anti-Ramsey numbers for matchings in regular bipartite graphs
Discrete Mathematics, Algorithms and Applications, 2017 Let [Formula: see text] be a family of graphs. The anti-Ramsey number [Formula: see text] for [Formula: see text] in the graph [Formula: see text] is the maximum number of colors in an edge coloring of [Formula: see text] that does not have any rainbow copy of any graph in [Formula: see text].
Zemin Jin +3 more
openaire +2 more sources
Bipartite anti‐Ramsey numbers of cycles
Journal of Graph Theory, 2004AbstractWe determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs.
Maria Axenovich +2 more
openaire +2 more sources
Local Anti-Ramsey Numbers of Graphs
Combinatorics, Probability and Computing, 2003A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.
Maria Axenovich +2 more
openaire +1 more source
Anti-Ramsey Numbers of Cycles of Length Three in Uniform Hypergraphs
Acta Mathematicae Applicatae Sinica, English Series, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tang, Yu-cong, Li, Tong
openaire +1 more source
Anti-Ramsey number of matchings in outerplanar graphs
Discrete Applied MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zemin Jin, Rui Yu, Yuefang Sun
openaire +1 more source
A short proof of anti-Ramsey number for cycles
International Journal of Multidisciplinary Research and Growth Evaluation, 2021Ramsey's theorem states that there exists a least positive integer R(r, s) for which every blue-red edge colouring of the complete graph on R(r, s) vertices contains a blue clique on r vertices or a red clique on s vertices. This work contains a simplified proof of Anti-Ramsey theorem for cycles. If there is an edge e between H and H0, incident to, say,
openaire +1 more source
Anti-Ramsey number of disjoint union of star-like hypergraphs
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yucong Tang, Tong Li, Guiying Yan
openaire +2 more sources
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs
Discrete Mathematics, 2022Erfang Shan, Liying Kang
exaly