A d-dimensional version of interval graphs, of Hamiltonian paths, and of binomial edge ideals

Abstract: We study the d-dimensional generalization of three mutually-related notions in graph theory: (unit)-interval graphs, Hamiltonian cycles, and binomial edge ideals.

This is joint work with Matteo Varbaro and Lisa Seccia (arXiv:2101.09243).

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456