Ron Aharoni

TL;DR: In this article, a block-iterative version of the Agmon-Motzkin-Schoenberg relaxation method for solving systems of linear inequalities is derived, and it is shown that any sequence of iterations generated by the algorithm converges if the intersection of the given family of convex sets is nonempty and that the limit point of the sequence belongs to this intersection under mild conditions on the sequence of weight functions.

TL;DR: The structure of minimal unsatisfiable CNF formulas in n variables containing precisely n + 1 clauses is characterised, and this characterization is given a geometric interpretation.

TL;DR: In this article, a hypergraph version of Hall's theorem is shown to be a topological topological theorem, and the proof is topological in the sense that it is topologically stable.

TL;DR: A weighted generalization of a theorem of Haxell, on independent systems of representatives (ISR’s) is proved, which proves that there exists a coloring of the graph by 2Δ colors, where each color class meets each Vi at precisely one vertex.

TL;DR: In this article, it was shown that in a tripartite 3-graph, the problem can be solved in polynomial time, and in a 3-dimensional graph.