53,760 research outputs found

    Contributions to graph theory

    Get PDF
    In this thesis we consider the following three topics in graph theory: spanning 2-connected subgraphs of grid graphs, Ramsey numbers for paths versus other graphs, and some variations of vertex colorings

    Ramsey numbers R(K3,G) for graphs of order 10

    Get PDF
    In this article we give the generalized triangle Ramsey numbers R(K3,G) of 12 005 158 of the 12 005 168 graphs of order 10. There are 10 graphs remaining for which we could not determine the Ramsey number. Most likely these graphs need approaches focusing on each individual graph in order to determine their triangle Ramsey number. The results were obtained by combining new computational and theoretical results. We also describe an optimized algorithm for the generation of all maximal triangle-free graphs and triangle Ramsey graphs. All Ramsey numbers up to 30 were computed by our implementation of this algorithm. We also prove some theoretical results that are applied to determine several triangle Ramsey numbers larger than 30. As not only the number of graphs is increasing very fast, but also the difficulty to determine Ramsey numbers, we consider it very likely that the table of all triangle Ramsey numbers for graphs of order 10 is the last complete table that can possibly be determined for a very long time.Comment: 24 pages, submitted for publication; added some comment

    Improved bounds on the multicolor Ramsey numbers of paths and even cycles

    Full text link
    We study the multicolor Ramsey numbers for paths and even cycles, Rk(Pn)R_k(P_n) and Rk(Cn)R_k(C_n), which are the smallest integers NN such that every coloring of the complete graph KNK_N has a monochromatic copy of PnP_n or CnC_n respectively. For a long time, Rk(Pn)R_k(P_n) has only been known to lie between (k−1+o(1))n(k-1+o(1))n and (k+o(1))n(k + o(1))n. A recent breakthrough by S\'ark\"ozy and later improvement by Davies, Jenssen and Roberts give an upper bound of (k−14+o(1))n(k - \frac{1}{4} + o(1))n. We improve the upper bound to (k−12+o(1))n(k - \frac{1}{2}+ o(1))n. Our approach uses structural insights in connected graphs without a large matching. These insights may be of independent interest
    • …
    corecore