On the maximum number of copies of H in graphs with given size and order

MLA

Dániel T. Nagy, et al. On the Maximum Number of Copies of H in Graphs with given Size and Order. Oct. 2018. 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=edsair&AN=edsair.doi.dedup.....9e071d66a92f5dc7aab2efddd160a4d3&authtype=sso&custid=ns315887.

APA

Dániel T. Nagy, Balázs Patkós, Dániel Gerbner, & Máté Vizer. (2018). On the maximum number of copies of H in graphs with given size and order.

Chicago

Dániel T. Nagy, Balázs Patkós, Dániel Gerbner, and Máté Vizer. 2018. “On the Maximum Number of Copies of H in Graphs with given Size and Order,” October. 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=edsair&AN=edsair.doi.dedup.....9e071d66a92f5dc7aab2efddd160a4d3&authtype=sso&custid=ns315887.