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.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Clique Is Hard on Average for Unary Sherali-Adams

Chat with Graph Search

Graph Powering and Spectral Robustness