{"id":"https://openalex.org/W4417082389","doi":"https://doi.org/10.48550/arxiv.2509.14807","title":"The Complexity of Finding and Counting Subtournaments","display_name":"The Complexity of Finding and Counting Subtournaments","publication_year":2025,"publication_date":"2025-09-18","ids":{"openalex":"https://openalex.org/W4417082389","doi":"https://doi.org/10.48550/arxiv.2509.14807"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.14807","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14807","pdf_url":"https://arxiv.org/pdf/2509.14807","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.14807","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120694323","display_name":"Simon D\u00f6ring","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00f6ring, Simon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120694324","display_name":"Sarah Houdaigoui","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Houdaigoui, Sarah","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120643810","display_name":"Lucas Picasarri-Arrieta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Picasarri-Arrieta, Lucas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030374322","display_name":"Philip Wellnitz","orcid":"https://orcid.org/0000-0002-6482-8478"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wellnitz, Philip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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.560699999332428,"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.560699999332428,"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.2199999988079071,"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.05620000138878822,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9467999935150146},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.899399995803833},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5357000231742859},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4778999984264374},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.448199987411499},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4449000060558319}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9467999935150146},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.899399995803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7024999856948853},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5357000231742859},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4453999996185303},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4449000060558319},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39959999918937683},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3239000141620636},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3091999888420105},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.28760001063346863}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.14807","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14807","pdf_url":"https://arxiv.org/pdf/2509.14807","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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.2509.14807","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.14807","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.14807","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14807","pdf_url":"https://arxiv.org/pdf/2509.14807","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":[],"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,65,87,143],"study":[1],"the":[2,26,35,40,83,97,121,139],"complexity":[3,84],"of":[4,19,42,44,74,82,85,94,124],"counting":[5,107],"and":[6,34,134],"finding":[7],"small":[8],"tournament":[9,17,32],"patterns":[10,130],"inside":[11],"large":[12],"tournaments.":[13,156],"Given":[14],"a":[15,31,67,79],"fixed":[16],"$T$":[18,93],"order":[20,95],"$k$,":[21],"we":[22,119,127],"write":[23],"${\\#}\\text{IndSub}_{\\text{To}}(\\{T\\})$":[24,56,99],"for":[25,61,90],"problem":[27,98],"whose":[28],"input":[29],"is":[30,37,57,100,136,147],"$G$":[33,45],"task":[36],"to":[38,49,59,77],"compute":[39,60],"number":[41],"subtournaments":[43],"that":[46,55,70,89,135,145],"are":[47],"isomorphic":[48],"$T$.":[50,64],"Previously,":[51],"Yuster":[52],"[Yus25]":[53],"obtained":[54],"hard":[58,105],"random":[62],"tournaments":[63,92],"consider":[66,120,129],"new":[68],"approach":[69],"uses":[71],"linear":[72],"combinations":[73],"subgraph-counts":[75],"[CDM17]":[76],"obtain":[78],"finer":[80],"analysis":[81],"${\\#}\\text{IndSub}_{\\text{To}}(\\{T\\})$.":[86],"show":[88,144],"all":[91],"$k$":[96],"always":[101],"at":[102],"least":[103],"as":[104,106,149,151],"$\\lfloor":[108],"3k/4":[109],"\\rfloor$-cliques.":[110],"This":[111],"immediately":[112],"yields":[113],"tight":[114],"bounds":[115],"under":[116],"ETH.":[117],"Further,":[118],"parameterized":[122,137],"version":[123],"${\\#}\\text{IndSub}_{\\text{To}}(\\mathcal{T})$":[125,146],"where":[126],"only":[128],"$T":[131],"\\in":[132],"\\mathcal{T}$":[133],"by":[138],"pattern":[140],"size":[141],"$|V(T)|$.":[142],"${\\#}W[1]$-hard":[148],"long":[150],"$\\mathcal{T}$":[152],"contains":[153],"infinitely":[154],"many":[155]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}