“三明治猜想”
用英语怎么说？

Random binomial graphs, first conceptualized in the late 1950s, provide a tractable model for studying network topology because each edge is determined by an independent coin flip. In contrast, regular graphs impose strict uniformity across all vertices, generating interdependent constraints that stymied researchers for decades. In the early 2000s, Jeong Han Kim and Van Ha Vu formulated the sandwich conjecture. They posited that one could design a unified random process to generate both graph variants simultaneously, ensuring the regular graph is tightly bounded below by a smaller binomial graph and above by a larger one.

20世纪50年代末首次被构想出来的随机二项式图，由于每条边都由独立的抛硬币决定，为研究网络拓扑提供了一个易于处理的模型。相比之下，正则图对所有顶点施加了严格的均匀性，产生了相互依存的约束，数十年来一直阻碍着研究人员。21世纪初，金正翰与武河文提出了三明治猜想。他们假设可以设计一种统一的随机过程同时生成这两种图变体，确保正则图在下方被一个较小的二项式图紧密界定，在上方被一个较大的二项式图所包夹。