The homomorphism domination exponent
Tài liệu tham khảo
Alon, 1981, On the number of subgraphs of prescribed type of graphs with a given number of edges, Israel J. Math., 38, 116, 10.1007/BF02761855
Borgs, 2006, Counting graph homomorphisms, vol. 26, 315
Friedgut, 2004, Hypergraphs, entropy, and inequalities, Amer. Math. Monthly, 111, 749, 10.2307/4145187
Friedgut, 1998, On the number of copies of one hypergraph in another, Israel J. Math., 105, 251, 10.1007/BF02780332
Galvin, 2004, On weighted graph homomorphisms, vol. 63, 97
Ioannidis, 1995, Containment of conjunctive queries: Beyond relations as sets, ACM Trans. Database Syst., 20, 288, 10.1145/211414.211419
Jayram, 2006, The containment problem for REAL conjunctive queries with inequalities, 80
Kahn, 2001, An entropy approach to the hard-core model on bipartite graphs, Combin. Probab. Comput., 10, 219, 10.1017/S0963548301004631
Kövári, 1954, On a problem of K. Zarankiewicz, Colloq. Math., 3, 50, 10.4064/cm-3-1-50-57
Razborov, 2007, Flag algebras, J. Symbolic Logic, 72, 1239, 10.2178/jsl/1203350785
Benjamin Rossman, Erik Vee, Counting homomorphisms from trees and cycles, 2006. Unpublished manuscript.
Ruzsa, 1978, Triple systems with no six points carrying three triangles, vol. 18, 939
Sidorenko, 1991, Inequalities for functionals generated by bipartite graphs, Diskret. Mat., 3, 50
Erik Vee, 2006. Personal communication.
Yeung, 2006