no code implementations • 15 Dec 2021 • Xizhi Liu, Sayan Mukherjee
Given a partition of a graph into connected components, the membership oracle asserts whether any two vertices of the graph lie in the same component or not.
no code implementations • 3 Feb 2021 • Xizhi Liu, Dhruv Mubayi, Christian Reiher
For every positive integer $t$ we construct a finite family of triple systems ${\mathcal M}_t$, determine its Tur\'{a}n number, and show that there are $t$ extremal ${\mathcal M}_t$-free configurations that are far from each other in edit-distance.
Combinatorics
