Nacionalni portal odprte znanosti

Given two graphs F_1 and F_2, their size Ramsey number, denoted by r̂(F_1, F_2), is the minimum number of edges of a graph G such that for any edge coloring of G by colors red and blue, G contains either a red copy of F1 or a blue copy of F2. In this paper, we deal with the size Ramsey number of sta ...

In a graph ▫$G$▫, let ▫$\rho_\triangle(G)$▫ denote the minimum size of a set of edges and triangles that cover all edges of ▫$G$▫, and let ▫$\alpha_1(G)$▫ be the maximum size of an edge set that contains at most one edge from each triangle. Motivated by a question of Erdős, Gallai, and Tuza, we stud ...