Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics

MLA

Bhattacharya, Bhaswar B., et al. Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics. 2013. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1310.2336&authtype=sso&custid=ns315887.

APA

Bhattacharya, B. B., Diaconis, P., & Mukherjee, S. (2013). Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics.

Chicago

Bhattacharya, Bhaswar B., Persi Diaconis, and Sumit Mukherjee. 2013. “Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1310.2336&authtype=sso&custid=ns315887.