Maximum star deleted from Ramsey graphs of book and tree

2020 ◽  
Vol 836 ◽  
pp. 37-41
Author(s):  
Ye Wang ◽  
Yusheng Li ◽  
Yan Li
Keyword(s):  
Ramsey Graphs

scholarly journals On Ramsey graphs without bipartite subgraphs

1992 ◽  
Vol 101 (1-3) ◽  
pp. 223-229 ◽  
Author(s):  
Jaroslav Nešetřil ◽  
Vojtěch Rödl
Keyword(s):  
Ramsey Graphs

Repeated communication and Ramsey graphs

1995 ◽  
Vol 41 (5) ◽  
pp. 1276-1289 ◽  
Author(s):  
N. Alon ◽  
A. Orlitsky
Keyword(s):  
Ramsey Graphs

scholarly journals Sparse Anti-Ramsey Graphs

1995 ◽  
Vol 63 (1) ◽  
pp. 146-152
Author(s):  
Y. Kohayakawa ◽  
T. Luczak
Keyword(s):  
Ramsey Graphs

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs

2018 ◽  
Vol 32 (2) ◽  
pp. 826-838 ◽  
Author(s):  
Hiệp Hàn ◽  
Vojtěch Rödl ◽  
Tibor Szabó
Keyword(s):  
Minimum Degree ◽  
Ramsey Graphs

scholarly journals A note on regular Ramsey graphs

2009 ◽  
pp. n/a-n/a ◽  
Author(s):  
Noga Alon ◽  
Sonny Ben-Shimon ◽  
Michael Krivelevich
Keyword(s):  
Ramsey Graphs

scholarly journals Applying Tabu Search to Determine New Ramsey Graphs

10.37236/1230 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Konrad Piwakowski
Keyword(s):  
Tabu Search ◽  
Lower Bounds ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Ramsey Numbers ◽  
Ramsey Graphs

In this note an adaptation of heuristic tabu search algorithm for finding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established: $R(3,13)\geq 59$, $R(4,10)\geq 80$, $R(4,11)\geq 96$, $R(4,12)\geq 106$, $R(4,13)\geq 118$, $R(4,14)\geq 129$, and $R(5,8)\geq 95$.

Sign in / Sign up

Export Citation Format

Share Document