A Limit Law of Almost <i>l</i>-partite Graphs
A Limit Law of Almost <i>l</i>-partite Graphs
Abstract For integers l ≥ 1, d ≥ 0 we study (undirected) graphs with vertices 1, …, n such that the vertices can be partitioned into l parts such that every vertex has at most d neighbours in its own part. The set of all such graphs is denoted P …