{"id":"https://openalex.org/W2090715877","doi":"https://doi.org/10.1137/s0895480195283798","title":"A Lower Bound for Adjacencies on the Traveling Salesman Polytope","display_name":"A Lower Bound for Adjacencies on the Traveling Salesman Polytope","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2090715877","doi":"https://doi.org/10.1137/s0895480195283798","mag":"2090715877"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480195283798","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480195283798","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077533780","display_name":"A. Sarangarajan","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Sarangarajan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5077533780"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.2304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"10","issue":"3","first_page":"431","last_page":"435"},"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.9983000159263611,"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.9983000159263611,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.963100016117096,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9449999928474426,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9359093904495239},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8749871253967285},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6506140232086182},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6374379396438599},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6274876594543457},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5867210626602173},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5724616050720215},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5508371591567993},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4692383110523224},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4630492031574249},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4204123020172119},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36861568689346313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1698346734046936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.0693846344947815}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9359093904495239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8749871253967285},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6506140232086182},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6374379396438599},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6274876594543457},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5867210626602173},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5724616050720215},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5508371591567993},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4692383110523224},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4630492031574249},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4204123020172119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36861568689346313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1698346734046936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0693846344947815},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480195283798","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480195283798","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W101975420","https://openalex.org/W1979802116","https://openalex.org/W1988551331","https://openalex.org/W1998324527","https://openalex.org/W2080455479","https://openalex.org/W2083281846","https://openalex.org/W2324108981"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W1525389557","https://openalex.org/W238609530","https://openalex.org/W2507185596","https://openalex.org/W2361554335","https://openalex.org/W1493684871","https://openalex.org/W34983847","https://openalex.org/W1481078225","https://openalex.org/W4285598206","https://openalex.org/W3186549454"],"abstract_inverted_index":{"We":[0,52,66],"study":[1],"adjacency":[2],"of":[3,12,18,43,46,76,80,90],"vertices":[4,81],"on":[5],"Tn,":[6],"the":[7,41,54,68,74,77],"asymmetric":[8],"traveling":[9],"salesman":[10],"polytope":[11],"degree":[13,42,55],"n.":[14,98],"Applying":[15],"a":[16,44,84],"result":[17],"G.":[19],"Boccara":[20],"[Discrete":[21],"Math.,":[22],"29":[23],"(1980),":[24],"pp.":[25],"105--134]":[26],"to":[27,56,83],"permutation":[28],"groups,":[29],"we":[30],"show":[31],"that":[32,40,94],"Tn":[33,47],"has":[34],"$\\Omega((n-1)(n-2)!\\,^2":[35],"\\log":[36,50],"n)$":[37],"edges,":[38],"implying":[39],"vertex":[45,86],"is":[48],"$\\Omega((n-2)!":[49,58],"n)$.":[51],"conjecture":[53,93],"be":[57],"(\\log":[59],"n)^k)$":[60],"for":[61,87],"any":[62],"positive":[63],"integer":[64],"k.":[65],"compute":[67],"density":[69],"function":[70],"$\\delta_n$":[71],"given":[72,85],"by":[73],"fraction":[75],"total":[78],"number":[79],"adjacent":[82],"small":[88],"values":[89],"n,":[91],"and":[92],"it":[95],"decreases":[96],"with":[97]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}