{"id":"https://openalex.org/W7161128477","doi":"https://doi.org/10.48550/arxiv.2605.13488","title":"The Gallai Vertex Problem is $\u0398_2^p$-Complete","display_name":"The Gallai Vertex Problem is $\u0398_2^p$-Complete","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161128477","doi":"https://doi.org/10.48550/arxiv.2605.13488"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:openaire/75f6b934-cef8-444a-ae03-e61ad946253c","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/75f6b934-cef8-444a-ae03-e61ad946253c","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikabadi, A, Rotenberg, E & Wulf, L 2026 'The Gallai Vertex Problem is $\u0398_2^p$-Complete' arXiv, pp. 1-17. https://doi.org/10.48550/arXiv.2605.13488","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/75f6b934-cef8-444a-ae03-e61ad946253c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090708839","display_name":"Amir Nikabadi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikabadi, Amir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136136150","display_name":"Eva Rotenberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wulf, Lasse","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7343000173568726,"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.7343000173568726,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.23970000445842743,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.00570000009611249,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6552000045776367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4758000075817108},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.445499986410141},{"id":"https://openalex.org/keywords/transversal","display_name":"Transversal (combinatorics)","score":0.44029998779296875},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.3474999964237213},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.33570000529289246}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7835000157356262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6827999949455261},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6552000045776367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4544000029563904},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.445499986410141},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.33570000529289246},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.29420000314712524},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.2874999940395355},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.atira.dk:openaire/75f6b934-cef8-444a-ae03-e61ad946253c","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/75f6b934-cef8-444a-ae03-e61ad946253c","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikabadi, A, Rotenberg, E & Wulf, L 2026 'The Gallai Vertex Problem is $\u0398_2^p$-Complete' arXiv, pp. 1-17. https://doi.org/10.48550/arXiv.2605.13488","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2605.13488","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13488","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,"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/75f6b934-cef8-444a-ae03-e61ad946253c","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/75f6b934-cef8-444a-ae03-e61ad946253c","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nikabadi, A, Rotenberg, E & Wulf, L 2026 'The Gallai Vertex Problem is $\u0398_2^p$-Complete' arXiv, pp. 1-17. https://doi.org/10.48550/arXiv.2605.13488","raw_type":"info:eu-repo/semantics/preprint"},"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":{"When":[0],"a":[1,5,19,43,58,86,89,120,123,150,175,183,198,210,221,230,246,258,281,296],"graph":[2,40,59,87,121,177,196,222,259],"$G$":[3],"admits":[4],"vertex":[6,63],"$v$":[7,18],"that":[8,37,128,187],"is":[9,35,64,130,149,178,206,257,268],"contained":[10],"in":[11,28,49,60,162,226],"all":[12,189],"its":[13,76,190,201],"longest":[14,68,170,191,202,216,261,276,305],"paths,":[15],"we":[16,105,111,126,244],"call":[17],"Gallai":[20,80,90,124,199],"vertex.":[21,44],"These":[22],"are":[23],"named":[24],"after":[25],"Gallai,":[26],"who":[27,56],"1966":[29],"asked":[30],"the":[31,50,71,79,114,133,159,169,179,195,215,275,304],"question":[32],"if":[33,194,255],"it":[34,129],"true":[36],"every":[38,62],"connected":[39,176],"contains":[41],"such":[42],"This":[45,140],"was":[46,92],"soon":[47],"answered":[48],"negative":[51],"by":[52,66,229,280,295],"Walther":[53],"and":[54],"Zamfirescu,":[55],"presented":[57],"which":[61],"omitted":[65],"some":[67],"path":[69,171,203,217,262,277],"of":[70,75,117,174,182,185,212,220,248],"graph.":[72],"In":[73,102,166,239,290],"spite":[74],"long":[77],"history,":[78],"Vertex":[81],"Problem,":[82],"i.e.":[83],"determining":[84,118],"whether":[85,119],"has":[88,122,197],"vertex,":[91,200],"until":[93],"now":[94],"neither":[95],"known":[96,143],"to":[97,147],"be":[98,224],"NP-":[99],"nor":[100],"co-NP-hard.":[101],"this":[103,249,292],"work,":[104],"show":[106,127,245],"something":[107],"much":[108],"stronger,":[109],"as":[110,144,209],"completely":[112],"settle":[113],"computational":[115],"complexity":[116,134,151],"vertex:":[125],"complete":[131],"for":[132,273,303],"class":[135,152,160],"$\u0398_2^p":[136],"=":[137,237,288],"\\text{P}^{\\text{NP}[\\log":[138],"n]}$.":[139],"class,":[141],"also":[142],"parallel":[145],"access":[146],"NP,":[148],"larger":[153],"than":[154,233,284],"NP":[155],"situated":[156],"just":[157],"below":[158,298],"$\u03a3^p_2$":[161],"Stockmeyer's":[163],"polynomial":[164,227,270],"hierarchy.":[165],"more":[167],"generality,":[168],"transversal":[172,204,218,263,278],"number":[173,205,219,264,279],"minimum":[180],"size":[181],"set":[184],"vertices":[186],"intersects":[188],"paths.":[192],"I.e.":[193],"$1$.":[207],"Thus,":[208],"consequence":[211],"our":[213],"theorem,":[214],"cannot":[223],"approximated":[225],"time":[228,271],"factor":[231,282,297],"better":[232,283],"2,":[234],"unless":[235,286],"$\\text{P}":[236,287],"\\text{NP}$.":[238,289],"fact,":[240],"using":[241],"related":[242],"techniques,":[243],"strengthening":[247],"result:":[250],"For":[251],"any":[252],"constant":[253],"$C$,":[254,265,285],"there":[256,267],"with":[260],"then":[266],"no":[269],"algorithm":[272],"approximating":[274],"particular,":[291],"excludes":[293],"approximation":[294],"$3$.":[299],"Similar":[300],"results":[301],"hold":[302],"cycle":[306],"transversal.":[307]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-15T00:00:00"}