T. Kalinowski

activity

20132023

most citedA Social Welfare Optimal Sequential Allocation Procedure

44 citations · 50 across the 5 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Zero forcing number of graphs

Thomas Kalinowski, Nina Kamčev, Benny Sudakov

A subset $S$ of initially infected vertices of a graph $G$ is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infe…

math.CO2017

Cube-magic labelings of grids

Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski

We show that the vertices and edges of a $d$ -dimensional grid graph $G = (V, E)$ ( $d ⩾ 2$ ) can be labeled with the integers from ${1, \dots, ∣ V ∣}$ and $\{1,\ldots,\…