We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the ...

Abstract: We study the sparsity of real polynomials that sign represent parity on n variables, each of which takes values from some finite subset A of integers. While the degree of such polynomials ...

Abstract: We investigate graph convolution networks with efficient learning from higher-order graph convolutions and direct learning from adjacency matrices for node classification. We revisit the ...