The purpose of this paper is to provide certain notes on how Knowledge Graphs can be analyzed and mined apart from the common Machine Learning algorithms or standard graph-based approaches. The current paper analyses some of the Ramsey-type results obtained for (mostly) geometrical graphs. Then a connection to the Knowledge Graphs problems is built. As a result, the paper presents potential routes to take when it comes to data mining for these particular problems.