Year: 2023
Type: article
Abstract: . A graph [Formula: see text] is said to be [Formula: see text]-Ramsey for a [Formula: see text]-tuple of graphs [Formula: see text], denoted by [Formula: see text], if every [Formula: see text]-edge-coloring of [Formula: see text] contains a monochromatic copy of [Formula: see text] in color [Formula: see text] for some [Formula: see text]. Let [Formula: see text] denote the smallest minimum degree of [Formula: see text] over all graphs [Formula: see text] that are minimal [Formula: see text]-Ramsey for [Formula: see text] (with respect to subgraph inclusion). The study of this parameter was initiated in 1976 by Burr, Erdős, and Lovász, who determined its value precisely for a pair of cliques. Over the past two decades the parameter [Formula: see text] has been studied by several groups of authors, their main focus being on the symmetric case, where [Formula: see text] for all [Formula: see text]. The asymmetric case, in contrast, has received much less attention. In this paper, we make progress in this direction, studying asymmetric tuples consisting of cliques, cycles, and trees. We determine [Formula: see text] when [Formula: see text] is a pair of one clique and one tree, a pair of one clique and one cycle, and a pair of two different cycles. We also generalize our results to multiple colors and obtain bounds on [Formula: see text] in terms of the size of the cliques [Formula: see text], the number of cycles, and the number of cliques. Our bounds are tight up to logarithmic factors when two of the three parameters are fixed.
DOI: 10.1137/21m1444953
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G5489237795
OpenAlex ID: W3198291244
