For many infinite families of graphs, these bounds are tight. Discussion of broadcasting in highly connected graphs leads to an exploration of dependence between the minimum degree in the graph and ...

This means that the graph must be “connected,” and this isn’t part of the Erdős-Hajnal conjecture. Is a large independent set unavoidable if such a graph isn’t necessarily connected? To see if we can ...

Simon Špacapan, SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES, Applicable Analysis and Discrete Mathematics, Vol. 15, No. 2 (October 2021), pp.

I co-created Graph Neural Networks while at Stanford. I recognized early on that this technology was incredibly powerful.