Nitya Mani

activity

20152022

H

-Free Graph

k

-Colorable

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2023

Strong spatial mixing for colorings on trees and its algorithmic applications

Zongchen Chen, Kuikui Liu, Nitya Mani +1

Strong spatial mixing (SSM) is an important quantitative notion of correlation decay for Gibbs distributions arising in statistical physics, probability theory, and theoretical com…

cs.DS2018

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming

Charles Carlson, Alexandra Kolla, Ray Li +3

For a graph $G$ , let $f (G)$ denote the size of the maximum cut in $G$ . The problem of estimating $f (G)$ as a function of the number of vertices and edges of $G$ has a long history…

Strong spatial mixing for colorings on trees and its algorithmic applications

Lower bounds for Max-Cut in H-free graphs via semidefinite programming

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming