Tag Archives: Flag complexes

Karim Adiprasito: Flag simplicial complexes and the non-revisiting path conjecture (A combinatorial proof of the Adiprasito-Benedetti theorem.)

Posted on November 12, 2012 by Gil Kalai

This post is authored by Karim Adiprasito The past months have seen some exciting progress on diameter bounds for polytopes and polytopal complexes, both in the negative and in the positive direction. Jesus de Loera and Steve Klee described simplicial polytopes which are not … Continue reading →

Posted in Convex polytopes, Guest blogger | Tagged Convex polytopes, Flag complexes, Hirsch conjecture, Karim Adiprasito | Leave a comment

	JSE on Meeting Michael H. at Rio
	Quantum Future: Just… on Why Quantum Computers Cannot W…
	Anonymous on Amazing: Simpler and more gene…
	Generalizations of t… on Coloring Simple Polytopes and…
	CUT THE ❌crap❌ CONVE… on To Cheer You Up in Difficult T…
	RJLipton+KWRegan on What is mathematics (or at lea…
	Ferdinand Ihringer on Extremal Combinatorics VI: The…
	Jon Awbrey on What is mathematics (or at lea…
	Congrats Avi and Lac… on Cheerful News in Difficult Tim…
	Yiftach on Alef’s Corner
	Gil Kalai on Alef’s Corner
	Yiftach on Alef’s Corner

Tag Archives: Flag complexes

Karim Adiprasito: Flag simplicial complexes and the non-revisiting path conjecture (A combinatorial proof of the Adiprasito-Benedetti theorem.)

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives