{"id":"https://openalex.org/W1969856863","doi":"https://doi.org/10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","display_name":"On the Maximum Density of Graphs with Unique-Path Labelings","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1969856863","doi":"https://doi.org/10.1137/120898528","mag":"1969856863"},"language":"en","primary_location":{"id":"doi:10.1137/120898528","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120898528","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/A5089076722","display_name":"Abbas Mehrabian","orcid":"https://orcid.org/0000-0002-0658-7709"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Abbas Mehrabian","raw_affiliation_strings":["Department of Combinatorics and Optimization"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009125793","display_name":"Dieter Mitsche","orcid":null},"institutions":[{"id":"https://openalex.org/I4210112930","display_name":"Laboratoire Jean-Alexandre Dieudonn\u00e9","ror":"https://ror.org/0274zdr66","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I201841394","https://openalex.org/I4210112930","https://openalex.org/I4210141950"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dieter Mitsche","raw_affiliation_strings":["Laboratoire Jean Alexandre Dieudonn\u00e9"],"affiliations":[{"raw_affiliation_string":"Laboratoire Jean Alexandre Dieudonn\u00e9","institution_ids":["https://openalex.org/I4210112930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079925942","display_name":"Pawe\u0142 Pra\u0142at","orcid":"https://orcid.org/0000-0001-9176-8493"},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 Pra\u0142at","raw_affiliation_strings":["Department of Mathematics"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics","institution_ids":["https://openalex.org/I530967"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089076722"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60969405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"27","issue":"3","first_page":"1228","last_page":"1233"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8763115406036377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8215712308883667},{"id":"https://openalex.org/keywords/edge-graceful-labeling","display_name":"Edge-graceful labeling","score":0.7999383211135864},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5848684310913086},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5789982676506042},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5734645128250122},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.521369993686676},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"Graph labeling","score":0.5140360593795776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5072409510612488},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49363386631011963},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.4600377678871155},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4458077847957611},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.4166775047779083},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.24618381261825562},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2105950117111206},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17883428931236267},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15102168917655945},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08152070641517639}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8763115406036377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8215712308883667},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.7999383211135864},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5848684310913086},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5789982676506042},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5734645128250122},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.521369993686676},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.5140360593795776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5072409510612488},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49363386631011963},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.4600377678871155},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4458077847957611},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.4166775047779083},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.24618381261825562},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2105950117111206},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17883428931236267},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15102168917655945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08152070641517639},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120898528","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120898528","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":4,"referenced_works":["https://openalex.org/W1594068533","https://openalex.org/W2026965858","https://openalex.org/W2152813177","https://openalex.org/W2173904855"],"related_works":["https://openalex.org/W2059234654","https://openalex.org/W4225706832","https://openalex.org/W2956061515","https://openalex.org/W2993208429","https://openalex.org/W4288436438","https://openalex.org/W3033625685","https://openalex.org/W2801876847","https://openalex.org/W2589672933","https://openalex.org/W1969856863","https://openalex.org/W2355816749"],"abstract_inverted_index":{"A":[0],"unique-path":[1,51,109],"labeling":[2,10,52,110],"of":[3,11,23,69,84,94],"a":[4,9,50,88,108],"simple,":[5],"finite":[6],"graph":[7,44,105],"is":[8,27,63,87],"its":[12],"edges":[13,58],"with":[14],"real":[15],"numbers":[16],"such":[17],"that":[18,42,48,60,106],"for":[19,65],"every":[20,98],"ordered":[21],"pair":[22],"vertices":[24,47],"$(u,v)$,":[25],"there":[26],"at":[28,54],"most":[29,55],"one":[30],"nondecreasing":[31],"path":[32],"from":[33],"$u$":[34],"to":[35],"$v$.":[36],"In":[37],"this":[38,61],"paper":[39],"we":[40,72,100],"prove":[41],"any":[43],"on":[45,75],"$n$":[46,99],"admits":[49,107],"has":[53,112],"$n":[56],"\\log_2(n)/2$":[57],"and":[59,111],"bound":[62],"tight":[64],"infinitely":[66],"many":[67],"values":[68],"$n$.":[70],"Thus":[71],"significantly":[73],"improve":[74],"the":[76,85],"previously":[77],"best":[78],"known":[79],"bounds.":[80],"The":[81],"main":[82],"tool":[83],"proof":[86],"combinatorial":[89],"lemma":[90],"which":[91],"might":[92],"be":[93],"independent":[95],"interest.":[96],"For":[97],"also":[101],"construct":[102],"an":[103],"$n$-vertex":[104],"$n\\log_2(n)/2":[113],"-":[114],"O(n)$":[115],"edges.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}