Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Large cliques and large independent sets: can they coexist?
Uriel Feige, Ilia Pauzner
For a graph and a parameter , we call a vertex -enabling if it belongs both to a clique of size and to an independent set of size , and we call it -excluding ot…
cs.DS2025
Upper bounds on the theta function of random graphs
Uriel Feige, Vadim Grinberg
The theta function of Lovasz is a graph parameter that can be computed up to arbitrary precision in polynomial time. It plays a key role in algorithms that approximate graph parame…