7,088 research outputs found

    On-line Ramsey numbers for paths and stars

    Get PDF
    Graphs and Algorithm

    Ramsey numbers of ordered graphs

    Full text link
    An ordered graph is a pair G=(G,)\mathcal{G}=(G,\prec) where GG is a graph and \prec is a total ordering of its vertices. The ordered Ramsey number R(G)\overline{R}(\mathcal{G}) is the minimum number NN such that every ordered complete graph with NN vertices and with edges colored by two colors contains a monochromatic copy of G\mathcal{G}. In contrast with the case of unordered graphs, we show that there are arbitrarily large ordered matchings Mn\mathcal{M}_n on nn vertices for which R(Mn)\overline{R}(\mathcal{M}_n) is superpolynomial in nn. This implies that ordered Ramsey numbers of the same graph can grow superpolynomially in the size of the graph in one ordering and remain linear in another ordering. We also prove that the ordered Ramsey number R(G)\overline{R}(\mathcal{G}) is polynomial in the number of vertices of G\mathcal{G} if the bandwidth of G\mathcal{G} is constant or if G\mathcal{G} is an ordered graph of constant degeneracy and constant interval chromatic number. The first result gives a positive answer to a question of Conlon, Fox, Lee, and Sudakov. For a few special classes of ordered paths, stars or matchings, we give asymptotically tight bounds on their ordered Ramsey numbers. For so-called monotone cycles we compute their ordered Ramsey numbers exactly. This result implies exact formulas for geometric Ramsey numbers of cycles introduced by K\'arolyi, Pach, T\'oth, and Valtr.Comment: 29 pages, 13 figures, to appear in Electronic Journal of Combinatoric

    Constrained Ramsey Numbers

    Full text link
    For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differently colored) subgraph isomorphic to T. The Erdos-Rado Canonical Ramsey Theorem implies that f(S, T) exists if and only if S is a star or T is acyclic, and much work has been done to determine the rate of growth of f(S, T) for various types of parameters. When S and T are both trees having s and t edges respectively, Jamison, Jiang, and Ling showed that f(S, T) <= O(st^2) and conjectured that it is always at most O(st). They also mentioned that one of the most interesting open special cases is when T is a path. In this work, we study this case and show that f(S, P_t) = O(st log t), which differs only by a logarithmic factor from the conjecture. This substantially improves the previous bounds for most values of s and t.Comment: 12 pages; minor revision

    On-line Ramsey numbers

    Get PDF
    Consider the following game between two players, Builder and Painter. Builder draws edges one at a time and Painter colours them, in either red or blue, as each appears. Builder's aim is to force Painter to draw a monochromatic copy of a fixed graph G. The minimum number of edges which Builder must draw, regardless of Painter's strategy, in order to guarantee that this happens is known as the on-line Ramsey number \tilde{r}(G) of G. Our main result, relating to the conjecture that \tilde{r}(K_t) = o(\binom{r(t)}{2}), is that there exists a constant c > 1 such that \tilde{r}(K_t) \leq c^{-t} \binom{r(t)}{2} for infinitely many values of t. We also prove a more specific upper bound for this number, showing that there exists a constant c such that \tilde{r}(K_t) \leq t^{-c \frac{\log t}{\log \log t}} 4^t. Finally, we prove a new upper bound for the on-line Ramsey number of the complete bipartite graph K_{t,t}.Comment: 11 page

    Space-time sensors using multiple-wave atom levitation

    Full text link
    The best clocks to date control the atomic motion by trapping the sample in an optical lattice and then interrogate the atomic transition by shining on these atoms a distinct laser of controlled frequency. In order to perform both tasks simultaneously and with the same laser field, we propose to use instead the levitation of a Bose-Einstein condensate through multiple-wave atomic interferences. The levitating condensate experiences a coherent localization in momentum and a controlled diffusion in altitude. The sample levitation is bound to resonance conditions used either for frequency or for acceleration measurements. The chosen vertical geometry solves the limitations imposed by the sample free fall in previous optical clocks using also atomic interferences. This configuration yields multiple-wave interferences enabling levitation and enhancing the measurement sensitivity. This setup, analogous to an atomic resonator in momentum space, constitutes an attractive alternative to existing atomic clocks and gravimeters.Comment: 5 pages, 4 figures.Final versio
    corecore