4 citations · 10 across the 9 of their papers we have counts for
6 papers · 1 filter
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz +1
Semi-random processes involve an adaptive decision-maker, whose goal is to achieve some predetermined objective in an online randomized environment. They have algorithmic implicati…
The hat guessing number of graphs
Noga Alon, Omri Ben-Eliezer, Chong Shangguan +1
Consider the following hat guessing game: players are placed on vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of possible colors.…
Ordered Graph Limits and Their Applications
Omri Ben-Eliezer, Eldar Fischer, Amit Levi +1
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described…
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on vertices. In every round of the process, one vert…
On the separation conjecture in Avoider-Enforcer games
Małgorzata Bednarska-Bzdȩga, Omri Ben-Eliezer, Lior Gishboliner +1
Given a fixed graph with at least two edges and positive integers and , the strict Avoider-Enforcer -game, played on the edge set of , has the fol…
Efficient Removal Lemmas for Matrices
Noga Alon, Omri Ben-Eliezer
The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable…