We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...