2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
Stanisław Cichomski, Fedor Petrov
We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let (U,V,E) be a bipartite graph with U={u1,u2,…,un} and $V=\{v_1, v_…