加载中…
We present a characterization of Robinsonian graphons for . Each graphon is the limit object of a sequence of edge density-normalized simple graphs under the cut distance . A graphon is Robinson if it satisfies the Robinson property: if , then , and it is Robinsonian if for some Robinson . In previous work, the author and collaborators introduced a graphon parameter that recognizes the Robinson property, where precisely when is Robinson. Using functional analytic arguments, we show here that for , the Robinsonian graphons are precisely those that are the cut distance limit object of graphs such that .

生成讲解博客的中文版本

生成AI智能校验的中文版本