You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Motivation: We currently have no way of taking cycles into account properly. For example, we can't recover the N^1.5 bound on triangles. However, we can recover the N^2 bound on 4-cycles, so it's not that bad.
I'd rather avoid using an explicit linear programming approach here if possible. One way to do this would be to add an explicit inference rule for triangles of DCs. This would probably handle the vast majority of cases here.
The text was updated successfully, but these errors were encountered:
Motivation: We currently have no way of taking cycles into account properly. For example, we can't recover the N^1.5 bound on triangles. However, we can recover the N^2 bound on 4-cycles, so it's not that bad.
I'd rather avoid using an explicit linear programming approach here if possible. One way to do this would be to add an explicit inference rule for triangles of DCs. This would probably handle the vast majority of cases here.
The text was updated successfully, but these errors were encountered: