3 citations · 9 across the 17 of their papers we have counts for
17 papers
Chromatic numbers from edge ideals: Graph classes with vanishing syzygies are polynomially -bounded
Alexander Engström
The chromatic number of a graph is bounded from below by its clique number but it can be arbitrary large. Perfect graphs are defined by for all induced subgraphs. An…
On the topological Kalai-Meshulam conjecture
Alexander Engstrom
Chudnovsky, Scott, Seymour and Spirkl recently proved a conjecture by Kalai and Meshulam stating that the reduced Euler characteristic of the independence complex of a graph withou…
Explicit Boij-Soderberg theory of ideals from a graph isomorphism reduction
Alexander Engstrom, Laura Jakobsson, Milo Orlich
In the origins of complexity theory Booth and Lueker showed that the question of whether two graphs are isomorphic or not can be reduced to the special case of chordal graphs. To p…
Expanders from Markov bases
Alexander Engstrom
Diaconis and Sturmfels introduced an influential method to construct Markov chains using commutative algebra. One major point of their method is that infinite families of graphs ar…
Graph colouring and the total Betti number
Alexander Engstrom
The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chroma…
Decompositions of Betti diagrams of powers of monomial ideals: A stability conjecture
Alexander Engstrom
We state a conjecture on the stability of Betti diagrams of powers of monomial ideals.