{"id":"https://openalex.org/W6966650332","doi":"https://doi.org/10.48550/arxiv.2505.24490","title":"On the maximum number of edges of outer k-planar graphs","display_name":"On the maximum number of edges of outer k-planar graphs","publication_year":2025,"publication_date":"2025-05-30","ids":{"openalex":"https://openalex.org/W6966650332","doi":"https://doi.org/10.48550/arxiv.2505.24490"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2505.24490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.24490","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2505.24490","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pfister, Maximilian","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pfister, Maximilian","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9415000081062317,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9415000081062317,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.010499999858438969,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5289999842643738},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5235000252723694},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.4681999981403351},{"id":"https://openalex.org/keywords/general-position","display_name":"General position","score":0.4456000030040741},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41100001335144043},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.3314000070095062},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.31690001487731934}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7914000153541565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7423999905586243},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5289999842643738},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5235000252723694},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.4681999981403351},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.4456000030040741},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41100001335144043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4104999899864197},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.3314000070095062},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.31690001487731934},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2808000147342682},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.2766999900341034},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.27469998598098755},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2667999863624573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2505.24490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.24490","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2505.24490","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.24490","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,46,73],"study":[1],"the":[2,15,33,52,55,76,79,92,105,110],"maximum":[3,34,106],"number":[4,35],"of":[5,36,38,62,117],"straight-line":[6],"segments":[7,85],"connecting":[8],"$n$":[9,44],"points":[10,80],"in":[11,14],"convex":[12],"position":[13],"plane,":[16],"so":[17],"that":[18],"each":[19],"segment":[20],"intersects":[21],"at":[22],"most":[23],"$k$":[24],"others.":[25],"This":[26],"question":[27],"can":[28],"also":[29,103],"be":[30,97,116],"framed":[31],"as":[32],"edges":[37,64],"an":[39,59],"outer":[40],"$k$-planar":[41],"graph":[42,94,112],"on":[43],"vertices.":[45],"outline":[47],"several":[48],"approaches":[49],"to":[50,96],"tackle":[51],"problem":[53,108],"with":[54],"best":[56],"approach":[57],"yielding":[58],"upper":[60],"bound":[61],"$(\\sqrt{2}+\\varepsilon)\\sqrt{k}n$":[63],"(with":[65],"$\\varepsilon":[66],"\\rightarrow":[67],"0$":[68],"for":[69,109],"sufficiently":[70],"large":[71],"$k$).":[72],"further":[74],"investigate":[75],"case":[77],"where":[78],"are":[81],"arbitrarily":[82],"bicolored":[83],"and":[84],"always":[86],"connect":[87],"two":[88],"different":[89],"colors":[90],"(i.e.,":[91],"corresponding":[93],"has":[95],"bipartite).":[98],"To":[99],"this":[100],"end,":[101],"we":[102],"consider":[104],"cut":[107],"circulant":[111],"$C_n^{1,2,\\dots,r}$":[113],"which":[114],"might":[115],"independent":[118],"interest.":[119]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}