Turan’s problem asks for the minimum number of triangles on n vertices so that every 4 vertices span a triangle. (Or equivalently, for the maximum number of triangles on n vertices without a … more →
Combinatorics and morewrote 1 year ago: Turan’s problem asks for the minimum number of triangles on n vertices so that every 4 vertice … more →
wrote 1 year ago: I will write a little about how hectic things are now here at HU, and make two (somewhat related) fo … more →
wrote 1 year ago: The “basic notion seminar” is an initiative of David Kazhdan who joined HU math departme … more →