activity
19992023
most citedSome connections between Falconer's distance set conjecture, and sets of Furstenburg type

108 citations · 378 across the 31 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2012

On the CNF-complexity of bipartite graphs containing no 's

Nets Hawk Katz

By a probabilistic construction, we find a bipartite graph having average degree which can be expressed as a conjunctive normal form using clauses. This contradicts…