{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:22:24Z","timestamp":1782825744883,"version":"3.54.5"},"reference-count":20,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":1665,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/doi.wiley.com\/10.1002\/tdm_license_1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Graph Theory"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1002\/jgt.20530","type":"journal-article","created":{"date-parts":[[2011,2,9]],"date-time":"2011-02-09T21:44:55Z","timestamp":1297287895000},"page":"261-284","source":"Crossref","is-referenced-by-count":20,"title":["Extremal graphs for homomorphisms"],"prefix":"10.1002","volume":"67","author":[{"given":"Jonathan","family":"Cutler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. J.","family":"Radcliffe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2011,2,9]]},"reference":[{"key":"10.1002\/jgt.20530-BIB1|cit1","volume-title":"Families of Vectors and Combinatorial Probability","author":"Bollob\u00e1s","year":"1986"},{"key":"10.1002\/jgt.20530-BIB2|cit2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1002\/jgt.20530-BIB3|cit3","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/3-540-33700-8_18","volume-title":"Topics in Discrete Mathematics","author":"Borgs","year":"2006"},{"issue":"3-4","key":"10.1002\/jgt.20530-BIB4|cit4","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1023\/A:1004573003122","article-title":"Nonmonotonic behavior in hard-core and Widom-Rowlinson models","volume":"94","author":"Brightwell","year":"1999","journal-title":"J Statist Phys"},{"key":"10.1002\/jgt.20530-BIB5|cit5","series-title":"Ann Discrete Math","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume-title":"Studies in Integer Programming (Proc. Workshop, Bonn, 1975) (Amsterdam)","author":"Chv\u00e1tal","year":"1977"},{"key":"10.1002\/jgt.20530-BIB6|cit6","unstructured":"J. Cutler A. J. Radcliffe https:\/\/2.zoppoz.workers.dev:443\/http\/www.pages.csam.montclair.edu\/\u223ccutler\/publications.html 2009"},{"issue":"1","key":"10.1002\/jgt.20530-BIB7|cit7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/S0894-0347-06-00529-7","article-title":"Reflection positivity, rank connectivity, and homomorphism of graphs","volume":"20","author":"Freedman","year":"2007","journal-title":"J Amer Math Soc"},{"key":"10.1002\/jgt.20530-BIB8|cit8","series-title":"(Providence, RI), DIMACS Ser Discrete Math Theoret Comput Sci","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1090\/dimacs\/063\/07","volume-title":"Graphs, Morphisms and Statistical Physics","author":"Galvin","year":"2004"},{"key":"10.1002\/jgt.20530-BIB9|cit9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1214\/ECP.v7-1048","article-title":"A monotonicity result for hard-core and Widom-Rowlinson models on certain d-dimensional lattices","volume":"7","author":"H\u00e4ggstr\u00f6m","year":"2002","journal-title":"Electron Comm Probab"},{"key":"10.1002\/jgt.20530-BIB10|cit10","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"Hell","year":"2004"},{"issue":"3","key":"10.1002\/jgt.20530-BIB11|cit11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0963548301004631","article-title":"An entropy approach to the hard-core model on bipartite graphs","volume":"10","author":"Kahn","year":"2001","journal-title":"Combin Probab Comput"},{"issue":"2","key":"10.1002\/jgt.20530-BIB12|cit12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1090\/S0002-9939-01-06058-0","article-title":"Entropy, independent sets and antichains: a new approach to Dedekind's problem","volume":"130","author":"Kahn","year":"2002","journal-title":"Proc Amer Math Soc"},{"key":"10.1002\/jgt.20530-BIB13|cit13","first-page":"187","volume-title":"Theory of graphs","author":"Katona","year":"1968"},{"key":"10.1002\/jgt.20530-BIB14|cit14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1525\/9780520319875-014","volume-title":"Mathematical Optimization Techniques","author":"Kruskal","year":"1963"},{"issue":"2","key":"10.1002\/jgt.20530-BIB15|cit15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190130207","article-title":"On the greatest number of 2 and 3 colorings of a (v,e)-graph","volume":"13","author":"Lazebnik","year":"1989","journal-title":"J Graph Theory"},{"issue":"1","key":"10.1002\/jgt.20530-BIB16|cit16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579408","article-title":"Legal coloring of graphs","volume":"6","author":"Linial","year":"1986","journal-title":"Combinatorica"},{"issue":"3","key":"10.1002\/jgt.20530-BIB17|cit17","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1112\/plms\/pdp041","article-title":"Maximizing the number of q-colorings","volume":"101","author":"Loh","year":"2010","journal-title":"Proc Lon Math Soc"},{"key":"10.1002\/jgt.20530-BIB18|cit18","series-title":"Annals of Discrete Mathematics","volume-title":"Threshold Graphs and Related Topics","author":"Mahadev","year":"1995"},{"issue":"4","key":"10.1002\/jgt.20530-BIB19|cit19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/(SICI)1097-0118(199908)31:4<283::AID-JGT3>3.0.CO;2-H","article-title":"(n,e)-graphs with maximum sum of squares of degrees","volume":"31","author":"Peled","year":"1999","journal-title":"J Graph Theory"},{"issue":"3","key":"10.1002\/jgt.20530-BIB20|cit20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(84)90013-9","article-title":"Backtrack an O(1) expected time algorithm for the graph coloring problem","volume":"18","author":"Wilf","year":"1984","journal-title":"Inform Process Lett"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.20530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/wol1\/doi\/10.1002\/jgt.20530\/fullpdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T19:42:19Z","timestamp":1637264539000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.20530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,9]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/jgt.20530","relation":{},"ISSN":["0364-9024"],"issn-type":[{"value":"0364-9024","type":"print"}],"subject":[],"published":{"date-parts":[[2011,2,9]]}}}