New bounds for Ramsey numbers R(K_k-e,K_l-e)

07/09/2021
by   Jan Goedgebeur, et al.
0

Let R(H_1,H_2) denote the Ramsey number for the graphs H_1, H_2, and let J_k be K_k-e. We present algorithms which enumerate all circulant and block-circulant Ramsey graphs for different types of graphs, thereby obtaining several new lower bounds on Ramsey numbers including: 49 ≤ R(K_3,J_12), 36 ≤ R(J_4,K_8), 43 ≤ R(J_4,J_10), 52 ≤ R(K_4,J_8), 37 ≤ R(J_5,J_6), 43 ≤ R(J_5,K_6), 65≤ R(J_5,J_7). We also use a gluing strategy to derive a new upper bound on R(J_5,J_6). With both strategies combined, we prove the value of two Ramsey numbers: R(J_5,J_6)=37 and R(J_5,J_7)=65. We also show that the 64-vertex extremal Ramsey graph for R(J_5,J_7) is unique. Furthermore, our algorithms also allow to establish new lower bounds and exact values on Ramsey numbers involving wheel graphs and complete bipartite graphs, including: R(W_7,W_4) = 21, R(W_7,W_7) = 19, R(K_3,4,K_3,4) = 25, and R(K_3,5, K_3,5)=33.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2019

New Bounds on k-Planar Crossing Numbers

The crossing number cr(G) of a graph G is the minimum number of crossing...
research
11/17/2020

On k-rainbow domination in middle graphs

Let G be a finite simple graph with vertex set V(G) and edge set E(G). A...
research
02/03/2022

On the Number of Graphs with a Given Histogram

Let G be a large (simple, unlabeled) dense graph on n vertices. Suppose ...
research
06/07/2020

Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond

Let α = (1+√(5))/2 and define the lower and upper Wythoff sequences by a...
research
11/06/2022

On Vertex Bisection Width of Random d-Regular Graphs

Vertex bisection is a graph partitioning problem in which the aim is to ...
research
05/17/2018

Bounds for the smallest k-chromatic graphs of given girth

Let n_g(k) denote the smallest order of a k-chromatic graph of girth at ...
research
10/08/2019

Improved lower bounds on parity vertex colourings of binary trees

A vertex colouring is called a parity vertex colouring if every path in ...

Please sign up or login with your details

Forgot password? Click here to reset