Yuval Ohapkin

most citedSubgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2023

Embedding theorems for random graphs with specified degrees

Pu Gao, Yuval Ohapkin

Given an $n \times n$ symmetric matrix $W \in [0, 1]^{[n] \times [n]}$ , let $G (n, W)$ be the random graph obtained by independently including each edge $j k$ with probability $…

math.CO2020★ 3 cited

Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity

Pu Gao, Yuval Ohapkin

Given a graphical degree sequence $d = (d_{1}, \dots, d_{n})$ , let $G (n, d)$ denote a uniformly random graph on vertex set $[n]$ where vertex $i$ has degree $d_{i}$ for every…