Search papers, labs, and topics across Lattice.
2
0
1
The chromatic number of the associahedron is proven to grow only double-logarithmically with its size.
Formalizing flag algebras in Lean not only secures the proofs of key extremal graph theorems but also reveals a new criterion for comparing graph constraint methods.