4 papers
Set-defined graph classes: -boundedness meets tropical algebra
Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons +2
We study set-defined graph classes: hereditary classes whose vertices are assigned fixed-length numerical tuples, with adjacency determined solely by equality patterns among coordi…
A Question of ErdÅs and Graham on Covering Systems
Sarosh Adenwalla
ErdÅs and Graham (ErdÅs and Graham, 1980) asked if there exists an such that the divisors of greater than 1 are the moduli of a distinct covering system with the followin…
On a Generalisation of a Function of Ron Graham's
Sarosh Adenwalla
Ron Graham introduced a function, , on the non-negative integers, in the 1986 Issue Problems column of \textit{Mathematical Magazine}: For each non-negative integer ,…
Boolean combinations of graphs
Sarosh Adenwalla, Samuel Braunfeld, John Sylvester +1
Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea ap…