{"id":"https://openalex.org/W2999466719","doi":"https://doi.org/10.37236/1902","title":"$k$-Colour Partitions of Acyclic Tournaments","display_name":"$k$-Colour Partitions of Acyclic Tournaments","publication_year":2005,"publication_date":"2005-01-07","ids":{"openalex":"https://openalex.org/W2999466719","doi":"https://doi.org/10.37236/1902","mag":"2999466719"},"language":"en","primary_location":{"id":"doi:10.37236/1902","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1902","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r5/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":null,"license_id":null,"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/v12i1r5/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022515462","display_name":"Paulo B\u00e1rcia","orcid":null},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Paulo Barcia","raw_affiliation_strings":["Universidade Nova de Lisboa, Faculdade de Economia Campus de Campolide, 1099-032 Lisboa, Portugal","Instituto Superior de Agronomia, Univ. T\u00e9cnica de Lisboa Tapada da Ajuda, 1349-017 Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"Universidade Nova de Lisboa, Faculdade de Economia Campus de Campolide, 1099-032 Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]},{"raw_affiliation_string":"Instituto Superior de Agronomia, Univ. T\u00e9cnica de Lisboa Tapada da Ajuda, 1349-017 Lisboa, Portugal","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036835727","display_name":"Jorge Orestes Cerdeira","orcid":"https://orcid.org/0000-0002-3814-7660"},"institutions":[{"id":"https://openalex.org/I83558840","display_name":"Universidade Nova de Lisboa","ror":"https://ror.org/02xankh89","country_code":"PT","type":"education","lineage":["https://openalex.org/I83558840"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"J. Orestes Cerdeira","raw_affiliation_strings":["Universidade Nova de Lisboa, Faculdade de Economia Campus de Campolide, 1099-032 Lisboa, Portugal","Instituto Superior de Agronomia, Univ. T\u00e9cnica de Lisboa Tapada da Ajuda, 1349-017 Lisboa, Portugal"],"affiliations":[{"raw_affiliation_string":"Universidade Nova de Lisboa, Faculdade de Economia Campus de Campolide, 1099-032 Lisboa, Portugal","institution_ids":["https://openalex.org/I83558840"]},{"raw_affiliation_string":"Instituto Superior de Agronomia, Univ. T\u00e9cnica de Lisboa Tapada da Ajuda, 1349-017 Lisboa, Portugal","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022515462"],"corresponding_institution_ids":["https://openalex.org/I83558840"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35307313,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"1","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.9983000159263611,"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.9983000159263611,"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.998199999332428,"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.9868000149726868,"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/mathematics","display_name":"Mathematics","score":0.8821905851364136},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8749171495437622},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.7818270325660706},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.751772403717041},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6102380156517029},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5759285688400269},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4840187728404999},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.45781177282333374},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4455990493297577},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40371814370155334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40338438749313354},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13236209750175476}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8821905851364136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8749171495437622},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.7818270325660706},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.751772403717041},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6102380156517029},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5759285688400269},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4840187728404999},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.45781177282333374},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4455990493297577},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40371814370155334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40338438749313354},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13236209750175476},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1902","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1902","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r5/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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.8069","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.8069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_12/PDF/v12i1r5.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1902","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1902","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r5/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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7049410507","display_name":null,"funder_award_id":"Portuguese Foundation for Science","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G943999617","display_name":null,"funder_award_id":"Technology","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2999466719.pdf","grobid_xml":"https://content.openalex.org/works/W2999466719.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1199371048","https://openalex.org/W1548164611","https://openalex.org/W2011039300","https://openalex.org/W2091972153","https://openalex.org/W2913343784"],"related_works":["https://openalex.org/W3123786980","https://openalex.org/W4287997709","https://openalex.org/W2994965880","https://openalex.org/W3083287393","https://openalex.org/W3094108612","https://openalex.org/W3125314910","https://openalex.org/W2982074041","https://openalex.org/W4366494774","https://openalex.org/W4385248312","https://openalex.org/W1987507258"],"abstract_inverted_index":{"Let":[0],"$G_{1}$":[1,47],"be":[2,35,186],"the":[3,7,36,81,106,110,117,120,146,150,158,197],"acyclic":[4],"tournament":[5],"with":[6,52,105],"topological":[8],"sort":[9],"$0":[10],"<":[11,13,15,17,19],"1":[12],"2":[14],"\\dots":[16],"n":[18],"n+1$":[20],"defined":[21],"on":[22],"node":[23,91],"set":[24,65],"$N\\cup":[25],"\\{0,n+1\\}$,":[26],"where":[27],"$N=\\{1,2,\\dots,n\\}$.":[28],"For":[29,125,166,176],"integer":[30],"$k\\geq":[31],"2$,":[32],"let":[33],"$G_{k}$":[34],"graph":[37],"obtained":[38],"by":[39],"taking":[40],"$k$":[41,55,67],"copies":[42],"of":[43,54,61,66,77,92,108,112,119,122,149,153,172],"every":[44,50,90],"arc":[45],"in":[46,96],"and":[48,89,136,160,188],"colouring":[49],"copy":[51],"one":[53,98],"different":[56,84,87],"colours.":[57],"A":[58],"$k$-colour":[59,114,129,154],"partition":[60,115],"$N$":[62,93],"is":[63,94,116,139],"a":[64,113,162,170],"paths":[68,85],"from":[69],"0":[70],"to":[71,185],"$n+1$":[72],"such":[73],"that":[74,180,189],"all":[75],"arcs":[76,107],"each":[78],"path":[79],"have":[80,86],"same":[82],"colour,":[83],"colours,":[88],"included":[95],"exactly":[97],"path.":[99],"If":[100],"there":[101],"are":[102],"costs":[103,121],"associated":[104],"$G_{k}$,":[109],"cost":[111,128],"sum":[118],"its":[123],"arcs.":[124],"determining":[126],"minimum":[127],"partitions":[130],"we":[131,168,178],"describe":[132],"an":[133,140],"$O(k^{2}n^{2k})$":[134],"algorithm,":[135],"show":[137,179],"this":[138],"NP-$hard$":[141],"problem.":[142],"We":[143,156],"also":[144],"study":[145],"convex":[147],"hull":[148],"incidence":[151],"vectors":[152],"partitions.":[155],"derive":[157],"dimension,":[159],"establish":[161],"minimal":[163],"equality":[164],"set.":[165],"$k>2$":[167],"identify":[169],"class":[171],"facet":[173,192],"inducing":[174],"inequalities.":[175],"$k=2$":[177],"these":[181],"inequalities":[182,194],"turn":[183],"out":[184],"equations,":[187],"no":[190],"other":[191],"defining":[193],"exists":[195],"besides":[196],"trivial":[198],"nonnegativity":[199],"constraints.":[200]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}