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 ...

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 ...