I. Newman

activity

20022023

most citedThe Stackelberg Minimum Spanning Tree Game

31 citations · 95 across the 16 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Large Simple d-Cycles in Simplicial Complexes

Roy Meshulam, Ilan Newman, Yuri Rabinovich

We show that the size of the largest simple d-cycle in a simplicial d-complex $K$ is at least a square root of $K$ 's density. This generalizes a well-known classical result of Erdő…

cs.CC2019★ 4 cited

On the Characterization of $1$ -sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix

Hiro Ito, Areej Khoury, Ilan Newman

We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of the focal directions of research…

math.CO2019

Hamiltonian and Pseudo-Hamiltonian Cycles and Fillings In Simplicial Complexes

Rogers Mathew, Ilan Newman, Yuri Rabinovich +1

We introduce and study a $d$ -dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$ -cycles in $K_{n}^{d}$ (the complete simplicial $d$ -complex over a vertex s…

Large Simple d-Cycles in Simplicial Complexes

On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix

Hamiltonian and Pseudo-Hamiltonian Cycles and Fillings In Simplicial Complexes

On the Characterization of $1$ -sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix