3 citations · 11 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Avoidable Vertices and Edges in Graphs
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich +2
A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \te…
math.CO2019
On the Sprague-Grundy function of compound games
Endre Boros, Vladimir Gurvich, Levi Kitrossky +1
The classical game of {\sc Nim} can be naturally extended and played on an arbitrary hypergraph $\cH \subseteq 2^V \setminus \{\emptyset\}$ whose vertices co…