2 problems
Far-from-Turán eigenvalue conjecture. For every , there exists such that, if is a regular -vertex graph that is -far from every Turán graph…
Let be the minimum number of triangles in an -graph. Let and denote the subclasses of and…
Far-from-Turán eigenvalue conjecture. For every , there exists such that, if is a regular -vertex graph that is -far from every Turán graph…
Let be the minimum number of triangles in an -graph. Let and denote the subclasses of and…