Chordality is a fundamental notion in graph theory; it finds application and stands in relation to graph colorings and perfect graphs, algorithmic graph theory, graph embeddings and Appolonian packings.

A central contribution to a proper understanding of chordality was provided in the work of Gromov and Kalai which connects chordality to framework rigidity of simplicial polytopes as proven by Cauchy (and many others following him): Chordality, in presence of framework rigidity, detects minimal rigidity of a simplicial polytope. I will relate graph chordality to the study of projective toric varieties and address a variety of problems concerning the combinatorics of polytopes.