Results 21 to 30 of about 120,363 (120)
Anti-Ramsey Numbers for Graphs with Independent Cycles [PDF]
The Electronic Journal of Combinatorics, 2009 An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let ${\cal G}$ be a family of graphs. The anti-Ramsey number $AR(n,{\cal G})$ for ${\cal G}$, introduced by Erdős et al., is the maximum number of colors in an edge coloring of $K_n$ that has no rainbow copy of any graph in ${\cal G}$. In this paper, we determine the
Zemin Jin, Xueliang Li 0001
openaire +2 more sources
The Outer-Planar Anti-Ramsey Number of Matchings
Symmetry, 2022 A subgraph H of an edge-colored graph G is called rainbow if all of its edges have different colors. Let ar(G,H) denote the maximum positive integer t, such that there is a t-edge-colored graph G without any rainbow subgraph H. We denote by kK2 a matching of size k and On the class of all maximal outer-planar graphs on n vertices, respectively.
Changyuan Xiang +3 more
openaire +1 more source
Avoiding rainbow 2-connected subgraphs
Open Mathematics, 2017 While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to ...
Gorgol Izolda
doaj +1 more source
Entanglement-based 3D magnetic gradiometry with an ultracold atomic scattering halo
New Journal of Physics, 2020 Ultracold collisions of Bose–Einstein condensates can be used to generate a large number of counter-propagating pairs of entangled atoms, which collectively form a thin spherical shell in momentum space, called a scattering halo.
D K Shin +4 more
doaj +1 more source
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
Mingyang Guo, Hongliang Lu, Xing Peng
openaire +2 more sources
, 1979 Earl Ramsey sings in his Madison County home for a group of high school students from Paideia school in Atlanta.
Ramsey, Earl;
core +4 more sources
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
Anti-Ramsey numbers of small graphs
Ars Comb., 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 edges have distinct colours.
Arie Bialostocki +2 more
openaire +2 more sources
Anti-Ramsey Numbers of Graphs with Small Connected Components [PDF]
Graphs and Combinatorics, 2015 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$ that each of its edges has a distinct colour. In this paper we determine, for large enough $n$, $AR(n,L\cup
Shoni Gilboa, Yehuda Roditty
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