Off-Diagonal Ramsey Numbers is a combinatorial function in Ramsey theory that designates the smallest integer \( R(s, t) \) such that any 2-coloring of the edges of a complete graph of order \( R(s, t) \) necessarily contains either a clique of size \( s \) in the first color or an independent set of size \( t \) in the second color, where \( s \neq t \).
9
Publications
451
Citations
15
Authors
7
Institutions
Publications per year
2017–2026
0
Parents
Publications
9
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers
Xiaodong Xu, Zheng Xie, Geoffrey Exoo et al. · The Electronic Journal of Combinatorics · 2004 · 48 citations · Full text
1–5 of 9
Authors
15
- SG
2
h-index
- RM
2
h-index
- GFGonzalo Fiz Pontiveros
Instituto Nacional de Matemática Pura e Aplicada, Brazil
2 publications · 92 citations
2
h-index
- AP
2
h-index
- JH
1
h-index
1–5 of 15
Institutions
7
University of Victoria
Victoria, Canada
2 h-index
2 publications
35 citations
Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
99 citations
Rochester Institute of Technology
Rochester, United States
1 h-index
1 publications
48 citations
National University of Defense Technology
Changsha, China
1 h-index
2 publications
96 citations
Stellenbosch University
Stellenbosch, South Africa
1 h-index
1 publications
25 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
1 publications
80 citations
Indiana State University
Terre Haute, United States
1 h-index
1 publications
48 citations
1–7 of 7
Venues
- Discrete Mathematics
2 publications · 35 citations
2
h-index
- arXiv (Cornell University)
Repository · 2 publications · 92 citations
2
h-index
- Random Structures and Algorithms
1 publications · 80 citations
1
h-index
- Israel Journal of Mathematics
1 publications · 19 citations
1
h-index
- Ars Combinatoria
1 publications · 14 citations
1
h-index
1–5