Results 31 to 40 of about 91,419 (162)
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
openaire +3 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
Gilboa, Shoni, Roditty, Yehuda
openaire +3 more sources
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
Discussiones Mathematicae Graph Theory, 2013 Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás.
Krop Elliot, Krop Irina
doaj +1 more source
The Mystery of the Ramsey Fringe that Didn't Chirp [PDF]
, 2002 We use precision microwave spectroscopy of magnetically trapped, ultra-cold 87Rb to characterize intra- and inter-state density correlations. The cold collision shifts for both normal and condensed clouds are measured.
Cornell, E. A. +3 more
core +6 more sources
, 2021 We determine the anti-Ramsey numbers for paths. This confirms a conjecture posed by Erd s, Simonovits and S s in 1970s.
openaire +2 more sources
Suppression of dephasing by qubit motion in superconducting circuits [PDF]
, 2015 We suggest and demonstrate a protocol which suppresses dephasing due to the low-frequency noise by qubit motion, i.e., transfer of the logical qubit of information in a system of $n \geq 2$ physical qubits. The protocol requires only the nearest-neighbor
Averin, D. V. +5 more
core +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
Anti-Ramsey Numbers of Subdivided Graphs
Journal of Combinatorial Theory, Series B, 2002 Given a coloring \(c\) of the edges of a graph \(G\), call a subgraph \(H\) of \(G\) rainbow if each of its edges is a different color. Given an integer \(n\) and a graph \(H\), let \(f(n, H)\) be the maximum number of colors of an edge-coloring of \(K_n\) admitting no rainbow copies of \(H\).
openaire +1 more source
, 2015 We report the realization and characterization using coherent population trapping (CPT) spectroscopy of an octadecyltrichlorosilane (OTS)-coated centimeter-scale Cs vapor cell.
Boudot, Rodolphe +7 more
core +2 more sources
Ramsey interferometry with generalized one-axis twisting echoes
, 2020 We consider a large class of Ramsey interferometry protocols which are enhanced by squeezing and un-squeezing operations before and after a phase signal is imprinted on the collective spin of $N$ particles.
Hammerer, Klemens +3 more
core +1 more source