{"id":"https://openalex.org/W1545507519","doi":"https://doi.org/10.1090/dimacs/063/07","title":"On weighted graph homomorphisms","display_name":"On weighted graph homomorphisms","publication_year":2004,"publication_date":"2004-03-16","ids":{"openalex":"https://openalex.org/W1545507519","doi":"https://doi.org/10.1090/dimacs/063/07","mag":"1545507519"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/063/07","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/063/07","pdf_url":"http://www.ams.org/dimacs/063/dimacs063.pdf","source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://www.ams.org/dimacs/063/dimacs063.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073164280","display_name":"David Galvin","orcid":"https://orcid.org/0000-0002-9777-9852"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"David Galvin","raw_affiliation_strings":["Microsoft Research, 1 Microsoft Way, Redmond WA 98052,","Microsoft"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, 1 Microsoft Way, Redmond WA 98052,","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047220138","display_name":"Prasad Tetali","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasad Tetali","raw_affiliation_strings":["School of Mathematics & College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0160"],"affiliations":[{"raw_affiliation_string":"School of Mathematics & College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0160","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073164280"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.12865497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7674106359481812},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.7058491706848145},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7045348882675171},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6988003253936768},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.6071894764900208},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5251050591468811},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5216365456581116},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5113553404808044},{"id":"https://openalex.org/keywords/finite-graph","display_name":"Finite graph","score":0.5011584758758545},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4822571873664856},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4688834846019745},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.43403369188308716},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4317166209220886},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.34602123498916626}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7674106359481812},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.7058491706848145},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7045348882675171},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6988003253936768},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6071894764900208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5251050591468811},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5216365456581116},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5113553404808044},{"id":"https://openalex.org/C2994516854","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Finite graph","level":3,"score":0.5011584758758545},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4822571873664856},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4688834846019745},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.43403369188308716},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4317166209220886},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.34602123498916626},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1090/dimacs/063/07","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/063/07","pdf_url":"http://www.ams.org/dimacs/063/dimacs063.pdf","source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:1206.3160","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1206.3160","pdf_url":"https://arxiv.org/pdf/1206.3160","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:1545507519","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1206.3160.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.9960","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.9960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.gatech.edu/~tetali/PUBLIS/gt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.7738","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.7738","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kam.mff.cuni.cz/~matousek/cla/galvin-tetali-homomorphisms.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.497.8506","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.497.8506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www3.nd.edu/~dgalvin1/pdf/weightedgraphhomomorphisms.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.759.983","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.759.983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1206.3160.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1206.3160","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1206.3160","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1090/dimacs/063/07","is_oa":true,"landing_page_url":"https://doi.org/10.1090/dimacs/063/07","pdf_url":"http://www.ams.org/dimacs/063/dimacs063.pdf","source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and\n                        Theoretical Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1545507519.pdf","grobid_xml":"https://content.openalex.org/works/W1545507519.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1834605046","https://openalex.org/W1986646471","https://openalex.org/W2056262613","https://openalex.org/W2072678675","https://openalex.org/W2157827214","https://openalex.org/W2594278890","https://openalex.org/W6628667382"],"related_works":["https://openalex.org/W1986646471","https://openalex.org/W2963011841","https://openalex.org/W2156786176","https://openalex.org/W3104768492","https://openalex.org/W2999454811","https://openalex.org/W2544865958","https://openalex.org/W2514852333","https://openalex.org/W2343336202","https://openalex.org/W2621129476","https://openalex.org/W2079814601","https://openalex.org/W1978155241","https://openalex.org/W2131467982","https://openalex.org/W3113616870","https://openalex.org/W2952132687","https://openalex.org/W2130452056","https://openalex.org/W1718505034","https://openalex.org/W2551566475","https://openalex.org/W2019781231","https://openalex.org/W3089503945","https://openalex.org/W2000467025"],"abstract_inverted_index":{"For":[0],"given":[1],"graphs":[2],"G":[3,16,28,42],"and":[4,29],"H,":[5],"let":[6],"|Hom(G,":[7,37,78],"H)|":[8,38,79],"denote":[9],"the":[10,59,72,75],"set":[11],"of":[12,47,55,61,74,77,82,87],"graph":[13,27,32],"homomorphisms":[14],"from":[15],"to":[17],"H.":[18,88],"We":[19,69],"show":[20],"that":[21],"for":[22],"any":[23,30],"finite,":[24],"n-regular,":[25],"bipartite":[26,67],"finite":[31],"H":[33],"(perhaps":[34],"with":[35],"loops),":[36],"is":[39,43],"maximum":[40],"when":[41],"a":[44,53,65,83],"disjoint":[45],"union":[46],"K":[48],"n,n":[49],"'s.":[50],"This":[51],"generalizes":[52],"result":[54],"J.":[56],"Kahn":[57],"on":[58],"number":[60],"independent":[62],"sets":[63],"in":[64,80],"regular":[66],"graph.":[68],"also":[70],"give":[71],"asymptotics":[73],"logarithm":[76],"terms":[81],"simply":[84],"expressed":[85],"parameter":[86]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-17T06:59:57.516163","created_date":"2025-10-10T00:00:00"}