{"id":"https://openalex.org/W7166701121","doi":"https://doi.org/10.48550/arxiv.2606.29157","title":"On the Complexity of Counting Orderings in Graphs","display_name":"On the Complexity of Counting Orderings in Graphs","publication_year":2026,"publication_date":"2026-06-28","ids":{"openalex":"https://openalex.org/W7166701121","doi":"https://doi.org/10.48550/arxiv.2606.29157"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.29157","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29157","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.29157","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011691423","display_name":"Marcelo Arenas","orcid":"https://orcid.org/0000-0003-3678-1868"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arenas, Marcelo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139659098","display_name":"Mar\u00eda Alejandra Schild","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schild, Mar\u00eda Alejandra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030108071","display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subercaseaux, Bernardo","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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.29030001163482666,"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.29030001163482666,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.24819999933242798,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.20419999957084656,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7002999782562256},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6687999963760376},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.6108999848365784},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5275999903678894},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5232999920845032},{"id":"https://openalex.org/keywords/rational-function","display_name":"Rational function","score":0.5163999795913696},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5034999847412109},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5002999901771545}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8027999997138977},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7002999782562256},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.670199990272522},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6687999963760376},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.6108999848365784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5284000039100647},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5275999903678894},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C75190567","wikidata":"https://www.wikidata.org/wiki/Q41237","display_name":"Rational function","level":2,"score":0.5163999795913696},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5002999901771545},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4415999948978424},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43369999527931213},{"id":"https://openalex.org/C139676723","wikidata":"https://www.wikidata.org/wiki/Q1193832","display_name":"Sign (mathematics)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C204911207","wikidata":"https://www.wikidata.org/wiki/Q860609","display_name":"Generating function","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.29157","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29157","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.29157","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.29157","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.4796815812587738,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,27,102],"study":[1],"the":[2,20,55,59,75,131,203,211],"computational":[3],"complexity":[4],"of":[5,12,16,19,32,44,51,61,77,139,144,148,154,157,164,166,174,205,213],"several":[6],"counting":[7,17,41,133,214],"problems":[8,14],"on":[9,202],"graphs.":[10],"Each":[11],"these":[13],"consists":[15],"orderings":[18,138],"vertices":[21],"or":[22],"edges":[23],"with":[24,86],"adjacency":[25],"constraints.":[26],"show":[28,73,128],"$\\#P$-completeness":[29,129],"for":[30,81,130,217],"all":[31],"them":[33],"via":[34],"a":[35,40,48,62,87,105,115,172],"common":[36],"new":[37],"technique.":[38],"Given":[39],"function":[42,89,107,112],"$C$":[43],"interest,":[45],"we":[46,72,127,190],"define":[47],"parameterized":[49],"family":[50],"instances":[52],"$G_q$,":[53],"where":[54],"parameter":[56],"$q$":[57,91],"controls":[58],"amplification":[60],"simple":[63],"gadget.":[64],"After":[65],"multiplying":[66],"by":[67,108,185],"an":[68,192],"explicit":[69],"factor":[70],"$f(q)$,":[71],"that":[74,198],"values":[76],"$f(q)":[78],"\\cdot":[79],"C(G_q)$,":[80],"positive":[82],"integers":[83],"$q$,":[84],"agree":[85],"rational":[88,111],"in":[90,99],"whose":[92],"numerator":[93],"and":[94,160,176,187,207],"denominator":[95],"can":[96],"be":[97],"interpolated":[98],"polynomial":[100],"time.":[101],"then":[103],"recover":[104],"$\\#P$-hard":[106],"evaluating":[109],"this":[110,125],"symbolically":[113],"at":[114],"limiting":[116],"value":[117],"$L":[118],"\\in":[119],"\\mathbb{Q}":[120],"\\cup":[121],"\\{\\infty,":[122],"-\\infty\\}$.":[123],"With":[124],"methodology,":[126],"following":[132],"problems:":[134],"(a)":[135],"successive":[136],"vertex":[137],"bipartite":[140,149],"graphs,":[141,145,150],"(b)":[142],"st-numberings":[143],"(c)":[146],"shellings":[147],"(d)":[151,170],"linear":[152,162,215],"extensions":[153,163,216],"N-free":[155],"posets":[156,165],"height":[158,167],"$3$,":[159],"(e)":[161,181],"$2$.":[168],"Result":[169],"settles":[171],"conjecture":[173],"Felsner":[175],"Manneville":[177],"(2015).":[178],"Although":[179],"result":[180,204],"was":[182],"first":[183],"proved":[184],"Dittmer":[186],"Pak":[188],"(2018),":[189],"include":[191],"alternative":[193],"proof,":[194],"using":[195],"our":[196],"technique,":[197],"does":[199],"not":[200],"rely":[201],"Brightwell":[206],"Winkler":[208],"(1991)":[209],"about":[210],"hardness":[212],"general":[218],"posets.":[219]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-01T00:00:00"}