On Ramsey Minimal Graphs
An elementary probabilistic argument is presented which shows that for every forest $F$ other than a matching, and every graph $G$ containing a cycle, there exists an infinite number of graphs $J$ such that $J\to (F,G)$ but if we delete from $J$ any edge $e$ the graph $J-e$ obtained in this way does not have this property.
Keyword(s):
2018 ◽
Vol 10
(1)
◽
pp. 31-51
Keyword(s):
1989 ◽
Vol 03
(15)
◽
pp. 1185-1188
◽
Keyword(s):
2016 ◽
Vol 31
(26)
◽
pp. 1630043
◽
Keyword(s):