Universality among graphs omitting a complete bipartite graph (Q2250798)

A weak embedding of a graph \(G=(V,E)\) into a graph \(G'=(V',E')\) is a one-to-one function \(F: V \rightarrow V'\) mapping an edge to an edge. Given three infinite cardinals \(\lambda \geq \theta \geq \kappa\), let \(\Gamma_{\lambda \theta \kappa}\) denote the set of all graphs \(G'\) with \(\lambda\) nodes for which there is no weak embedding of the complete \((\theta,\kappa)\)-bipartite graph into \(G'\). The question addressed in the paper is whether there is \(G'\) in \(\Gamma_{\lambda \theta \kappa}\) that is universal in the sense that any \(G\) in \(\Gamma_{\lambda \theta \kappa}\) weakly embeds into \(G'\). Here are two of the results established by the author. Theorem A. Assuming that \(\lambda\) is a strong limit cardinal, the answer is positive if and only if \(\mathrm{cf}(\lambda) \leq \mathrm{cf}(\kappa)\) and either \(\kappa < \theta\), or \(\mathrm{cf}(\lambda) < \mathrm{cf}(\theta)\). Theorem B. Assuming that \(\lambda = \mu^+ = 2^{\mu}\), where \(\mu = 2^{< \mu}\), the answer is positive if and only if \(\mu = \mu^{\kappa}\) and \(\theta = \lambda\).