Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

Clique Is Hard on Average for Unary Sherali-Adams

Kilian Risse
2023
Conference Papers

Abstract

We prove that unary Sherali-Adams requires proofs of size n(Omega(d)) to rule out the existence of an n(Theta(1))-clique in Erdos-Renyi random graphs whose maximum clique is of size d

Official source

https://infoscience.epfl.ch/entities/publication/4b8e846d-7750-42c1-b3d2-e7266fedac8f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Clique Is Hard on Average for Unary Sherali-Adams

Graph Chatbot

Graph Powering and Spectral Robustness