Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques |
| |
Authors: | Andrey Grinshpun Raj Raina Rik Sengupta |
| |
Affiliation: | 1. DEPARTMENT OF MATHEMATICS, MIT, CAMBRIDGE, MASSACHUSETTS;2. STANFORD UNIVERSITY |
| |
Abstract: | For graphs F and H, we say F is Ramsey for H if every 2‐coloring of the edges of F contains a monochromatic copy of H. The graph F is Ramsey H‐minimal if F is Ramsey for H and there is no proper subgraph of F so that is Ramsey for H. Burr et al. defined to be the minimum degree of F over all Ramsey H‐minimal graphs F. Define to be a graph on vertices consisting of a complete graph on t vertices and one additional vertex of degree d. We show that for all values ; it was previously known that , so it is surprising that is much smaller. We also make some further progress on some sparser graphs. Fox and Lin observed that for all graphs H, where is the minimum degree of H; Szabó et al. investigated which graphs have this property and conjectured that all bipartite graphs H without isolated vertices satisfy . Fox et al. further conjectured that all connected triangle‐free graphs with at least two vertices satisfy this property. We show that d‐regular 3‐connected triangle‐free graphs H, with one extra technical constraint, satisfy ; the extra constraint is that H has a vertex v so that if one removes v and its neighborhood from H, the remainder is connected. |
| |
Keywords: | Ramsey minimal graphs |
|
|