Results 11 to 20 of about 91,419 (162)
Anti-Ramsey numbers of small graphs [PDF]
, 2013 The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose ...
Bialostocki, Arie +2 more
core +2 more sources
Approximation bounds on maximum edge 2-coloring of dense graphs
, 2018 For a graph $G$ and integer $q\geq 2$, an edge $q$-coloring of $G$ is an assignment of colors to edges of $G$, such that edges incident on a vertex span at most $q$ distinct colors.
Chandran, L. Sunil +3 more
core +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
On the anti-Ramsey number of forests [PDF]
Discrete Applied Mathematics, 2021 18 pages, 1 ...
Chunqiu Fang +3 more
openaire +3 more sources
Anti-Ramsey Numbers in Complete k-Partite Graphs [PDF]
Mathematical Problems in Engineering, 2020 The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbers ARKp1,p2,…,pk,Tn, ARKp1,p2,…,pk,ℳ, and ARKp1,p2,…,pk,C of Kp1,p2,…,pk, where Tn,ℳ, and C denote the family of all spanning trees, the family of all perfect ...
Jili Ding, Hong Bian, Haizheng Yu
openaire +1 more source
Therapeutic advances in pruritus as a model of personalized medicine. [PDF]
J Eur Acad Dermatol VenereolRecent advances in itch biology reveal that chronic pruritus arises from distinct neuroimmune pathways driven by cytokines, JAK, BTK and GPCRs. Targeted biologics and small molecule inhibitors such as dupilumab, nemolizumab, remibrutinib and JAK inhibitors precisely modulate these pathways, leading to a new era of personalized therapeutics in pruritus.
Auyeung K, Kubofcik R, Kim BS.
europepmc +2 more sources
Online and size anti-Ramsey numbers [PDF]
Journal of Combinatorics, 2014 19 pages, 4 ...
Axenovich, Maria +3 more
openaire +2 more sources
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
SIAM Journal on Discrete Mathematics, 2023 Let $n,s,$ and $k$ be positive integers such that $k\geq 3$, $s\geq 3$ and $n\geq ks$. An $s$-matching $M_s$ in a $k$-uniform hypergraph is a set of $s$ pairwise disjoint edges. The anti-Ramsey number $\textrm{ar}(n,k,M_s)$ of an $s$-matching is the smallest integer $c$ such that each edge-coloring of the $n$-vertex $k$-uniform complete hypergraph with
Guo, Mingyang, Lu, Hongliang, Peng, Xing
openaire +2 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
Fangfang Wu +3 more
openaire +2 more sources
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees [PDF]
SIAM Journal on Discrete Mathematics, 2020 An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [J.
Linyuan Lu, Zhiyu Wang
openaire +3 more sources