Abstract
We study the validity of the first-order zero-one law for the binomial -partite random graph in two settings: dense (the probability of appearance of an edge is a constant) and sparse (, where is the cardinality of each part of the graph). On the way, we prove that, for every rational , there exists a bipartite strictly balanced graph with density .
Citation
Juan Carlos Buitrago Oropeza. "Zero-one laws for random -partite graphs." Mosc. J. Comb. Number Theory 10 (4) 315 - 337, 2022. https://doi.org/10.2140/moscow.2021.10.315
Information