{"id":"https://openalex.org/W7221507263","doi":"https://doi.org/10.48550/arxiv.2610.12836","title":"Connectivity, toughness, and hamiltonicity of simplicial polytopes","display_name":"Connectivity, toughness, and hamiltonicity of simplicial polytopes","publication_year":2026,"publication_date":"2026-10-09","ids":{"openalex":"https://openalex.org/W7221507263","doi":"https://doi.org/10.48550/arxiv.2610.12836"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.12836","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.12836","pdf_url":"https://arxiv.org/pdf/2610.12836","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.12836","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044609877","display_name":"Guillermo Pineda\u2010Villavicencio","orcid":"https://orcid.org/0000-0002-2904-6657","observed_orcids":["https://orcid.org/0000-0002-2904-6657"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pineda-Villavicencio, Guillermo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044609877"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9282000064849854,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9282000064849854,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.03400000184774399,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.014999999664723873,"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/simplicial-polytopes","display_name":"simplicial polytopes","score":0.9990000128746033},{"id":"https://openalex.org/keywords/graph-connectivity","display_name":"graph connectivity","score":0.8939999938011169},{"id":"https://openalex.org/keywords/graph-toughness","display_name":"graph toughness","score":0.8550000190734863},{"id":"https://openalex.org/keywords/hamiltonicity","display_name":"Hamiltonicity","score":0.9110000133514404},{"id":"https://openalex.org/keywords/whitney-s-theorem","display_name":"Whitney's theorem","score":0.6850000023841858},{"id":"https://openalex.org/keywords/tutte-s-theorem","display_name":"Tutte's theorem","score":0.9879999756813049},{"id":"https://openalex.org/keywords/spanning-trees","display_name":"spanning trees","score":0.8309999704360962},{"id":"https://openalex.org/keywords/prism","display_name":"PRISM","score":0.8529999852180481},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"longest path","score":0.6779999732971191},{"id":"https://openalex.org/keywords/counterexample","display_name":"counterexample","score":0.7329999804496765}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8234000205993652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8174999952316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49320000410079956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.489300012588501},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48069998621940613},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.45730000734329224},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C3469331","wikidata":"https://www.wikidata.org/wiki/Q7520902","display_name":"Simplicial homology","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C17327563","wikidata":"https://www.wikidata.org/wiki/Q1991405","display_name":"Nowhere dense set","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.26159998774528503},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.12836","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.12836","pdf_url":"https://arxiv.org/pdf/2610.12836","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2610.12836","doi":"https://doi.org/10.48550/arxiv.2610.12836","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.12836","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.12836","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.12836","pdf_url":"https://arxiv.org/pdf/2610.12836","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7221507263.pdf","grobid_xml":"https://content.openalex.org/works/W7221507263.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4226322581","https://openalex.org/W1978317654","https://openalex.org/W4395086347","https://openalex.org/W4417005974","https://openalex.org/W1993036772","https://openalex.org/W4406745829","https://openalex.org/W3124819471","https://openalex.org/W1992467241","https://openalex.org/W2035239952","https://openalex.org/W1999920904"],"abstract_inverted_index":{"For":[0,86,123],"every":[1,3,9],"$d\\ge4$,":[2,88],"prescribed":[4],"connectivity":[5,19,46,68,76,150],"$r\\ge":[6,89],"d$,":[7,90],"and":[8,24,37,74,82,91,120,126,137,158],"$\\varepsilon>0$,":[10],"we":[11,128],"construct":[12],"a":[13,56],"simplicial":[14,147],"$d$-polytope":[15],"whose":[16,134],"graph":[17],"has":[18,25,153],"exactly":[20,151],"$r$,":[21,127],"is":[22],"nontraceable,":[23],"toughness":[26],"less":[27],"than":[28],"$\\varepsilon$.":[29],"Thus":[30],"the":[31,75,94,144],"classical":[32],"theorems":[33],"of":[34,71,146],"Whitney":[35],"(1931)":[36],"Tutte":[38],"(1956),":[39],"which":[40],"guarantee":[41],"hamiltonicity":[42,70],"under":[43],"sufficiently":[44,66],"high":[45,67],"in":[47,62,84],"dimension":[48],"three,":[49],"have":[50,100],"no":[51,101,112],"higher-dimensional":[52],"counterpart.":[53],"This":[54],"answers":[55],"question":[57],"posed":[58],"by":[59,79],"Bojan":[60],"Mohar":[61],"2001":[63],"on":[64,131],"whether":[65],"guarantees":[69],"$4$-polytopal":[72],"graphs":[73,130],"questions":[77],"raised":[78],"Ikegami,":[80],"Maezawa,":[81],"Zamfirescu":[83],"2021.":[85],"fixed":[87,124],"integer":[92],"$k\\ge2$,":[93],"examples":[95],"can":[96],"be":[97],"chosen":[98],"to":[99],"closed":[102],"spanning":[103,113],"walk":[104],"with":[105,115,149],"at":[106,117,161],"most":[107,118,162],"$k$":[108],"visits":[109],"per":[110],"vertex,":[111],"tree":[114],"degrees":[116],"$k$,":[119],"nontraceable":[121],"prisms.":[122],"$d$":[125],"obtain":[129],"$n$":[132],"vertices":[133],"longest":[135],"paths":[136],"cycles":[138],"contain":[139],"$O(\\sqrt":[140],"n)$":[141],"vertices.":[142],"Consequently,":[143],"family":[145],"$d$-polytopes":[148],"$r$":[152],"Gr\u00fcnbaum--Walther":[154],"shortness":[155,159],"coefficient":[156],"zero":[157],"exponent":[160],"$1/2$.":[163]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-10-13T00:00:00"}