Skip to content

Author

Obinna Okechukwu

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Clique partitions and bounded simplicial defect

The clique partition number of a graph is the minimum number of complete subgraphs whose edge sets partition its edge set. We study graphs in which, in every induced subgraph and outside every prescribed clique, some vertex has a neighbourhood that becomes a clique after deleting at most $s$ vertices. The case $s=0$ is...

Obinna Okechukwu · 0 citations
Preprint Sep 2026

Local decisions, diffusive influence, and lower bounds for graphical balanced allocation

In graphical two-choice allocation, each arriving ball is assigned to one endpoint of a random edge. We study rules whose decision is a monotone function of the two endpoint loads, allowing edge-dependent thresholds and fresh randomization. Such a rule has an exact unit-discrepancy coupling: adding one ball to the init...

Obinna Okechukwu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.