{"id":"https://openalex.org/W3093920812","doi":"https://doi.org/10.37236/9336","title":"Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs","display_name":"Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs","publication_year":2020,"publication_date":"2020-10-16","ids":{"openalex":"https://openalex.org/W3093920812","doi":"https://doi.org/10.37236/9336","mag":"3093920812"},"language":"en","primary_location":{"id":"doi:10.37236/9336","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9336","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p13/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["Department of Mathematics University of Haifa Haifa 3498838, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Haifa Haifa 3498838, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026016357"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":0.547,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63454433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"4","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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9991000294685364,"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/tournament","display_name":"Tournament","score":0.9564515948295593},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.897059977054596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7929655313491821},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.656462550163269},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5140348672866821},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5138835906982422},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46208640933036804},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.46167871356010437},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4528248906135559},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4458872079849243},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4234950542449951},{"id":"https://openalex.org/keywords/order-type","display_name":"Order type","score":0.42231130599975586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3848487138748169},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08441442251205444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06996336579322815}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9564515948295593},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.897059977054596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7929655313491821},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.656462550163269},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5140348672866821},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5138835906982422},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46208640933036804},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46167871356010437},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4528248906135559},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4458872079849243},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4234950542449951},{"id":"https://openalex.org/C138890893","wikidata":"https://www.wikidata.org/wiki/Q620006","display_name":"Order type","level":2,"score":0.42231130599975586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3848487138748169},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08441442251205444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06996336579322815},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/9336","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9336","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/9336","is_oa":true,"landing_page_url":"https://doi.org/10.37236/9336","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3093920812.pdf","grobid_xml":"https://content.openalex.org/works/W3093920812.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1487872891","https://openalex.org/W1548164611","https://openalex.org/W1574826618","https://openalex.org/W1973382524","https://openalex.org/W2023354972","https://openalex.org/W2025565016","https://openalex.org/W2058968544","https://openalex.org/W2069367490","https://openalex.org/W2091822927","https://openalex.org/W2105188136","https://openalex.org/W2139690594","https://openalex.org/W2148712149","https://openalex.org/W2313696863","https://openalex.org/W2964277984","https://openalex.org/W4255609236","https://openalex.org/W6680547112","https://openalex.org/W6682220409","https://openalex.org/W6684457114"],"related_works":["https://openalex.org/W2085331515","https://openalex.org/W2604879517","https://openalex.org/W2363112923","https://openalex.org/W4288723498","https://openalex.org/W2354764436","https://openalex.org/W4386974102","https://openalex.org/W1997206487","https://openalex.org/W1512669878","https://openalex.org/W4287028074","https://openalex.org/W4292730466"],"abstract_inverted_index":{"While":[0],"the":[1,41,46,54,69,80,101,107,130],"edges":[2,102],"of":[3,27,57,72,79,103,110,134,139],"every":[4],"tournament":[5,29],"can":[6],"be":[7],"covered":[8],"with":[9,30,106],"two":[10],"spanning":[11,31,111],"acyclic":[12,25,32,112],"subgraphs,":[13,33],"this":[14,125],"is":[15,76,86,114],"not":[16],"so":[17],"if":[18],"we":[19],"set":[20],"out":[21],"to":[22,97],"cover":[23],"all":[24,136],"$H$-subgraphs":[26],"a":[28,88,104,115,120,140],"even":[34],"for":[35,53,63,124],"very":[36],"simple":[37],"$H$":[38,65],"such":[39,60],"as":[40],"$2$-edge":[42,47],"directed":[43],"path":[44],"or":[45],"out-star.":[48],"We":[49,118],"prove":[50,119],"new":[51,121],"bounds":[52,67],"minimum":[55,108],"number":[56,109],"elements":[58],"in":[59],"coverings":[61],"and":[62],"some":[64],"our":[66],"determine":[68],"exact":[70],"order":[71,90],"magnitude.":[73],"A":[74],"$k$-tournament":[75],"an":[77],"orientation":[78],"complete":[81],"$k$-graph,":[82],"where":[83],"each":[84],"$k$-set":[85],"given":[87],"total":[89],"(so":[91],"tournaments":[92],"are":[93],"$2$-tournaments).":[94],"As":[95],"opposed":[96],"tournaments,":[98],"already":[99],"covering":[100,135],"$3$-tournament":[105],"subhypergraphs":[113],"nontrivial":[116],"problem.":[117],"lower":[122,132],"bound":[123,133],"problem":[126],"which":[127],"asymptotically":[128],"matches":[129],"known":[131],"ordered":[137],"triples":[138],"set.":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}