Ramsey Graphs is a construct in combinatorics denoting a graph that exemplifies the minimal size or structure ensuring the presence of either a complete subgraph or an independent set of specified order, thereby witnessing Ramsey-type properties in extremal graph theory.
368
Publications
13.1K
Citations
402
Authors
240
Institutions
Publications per year
2017–2026
51
Parents
Publications
368
Stanisław Radziszowski · The Electronic Journal of Combinatorics · 2011 · 430 citations · Full text
Tree‐complete graph ramsey numbers
Vašek Chvátal · Journal of Graph Theory · 1977 · 194 citations
1–5 of 368
Authors
402
- CR
16
h-index
- BS
14
h-index
- VR
14
h-index
- RH
12
h-index
- RJ
12
h-index
1–5 of 402
Institutions
240
University of Memphis
Memphis, United States
19 h-index
63 publications
2.1K citations
Hungarian Academy of Sciences
Budapest, Hungary
18 h-index
37 publications
1.5K citations
Emory University
Atlanta, United States
16 h-index
31 publications
944 citations
University of Illinois Urbana-Champaign
Urbana, United States
14 h-index
27 publications
677 citations
Tel Aviv University
Tel Aviv, Israel
14 h-index
23 publications
1.1K citations
Charles University
Prague, Czechia
12 h-index
28 publications
946 citations
Adam Mickiewicz University in Poznań
Poznan, Poland
12 h-index
18 publications
655 citations
Universidade de São Paulo
São Paulo, Brazil
12 h-index
19 publications
497 citations
1–8 of 240
Venues
- Journal of Graph Theory
46 publications · 1.6K citations
23
h-index
- Discrete Mathematics
38 publications · 990 citations
19
h-index
- Journal of Combinatorial Theory Series B
24 publications · 1.4K citations
18
h-index
- Combinatorics Probability Computing
24 publications · 897 citations
17
h-index
- Random Structures and Algorithms
23 publications · 1K citations
15
h-index
1–5