{"id":"https://openalex.org/W2175149620","doi":"https://doi.org/10.1017/s0963548317000153","title":"On the Maximum Number of Spanning Copies of an Orientation in a Tournament","display_name":"On the Maximum Number of Spanning Copies of an Orientation in a Tournament","publication_year":2017,"publication_date":"2017-06-06","ids":{"openalex":"https://openalex.org/W2175149620","doi":"https://doi.org/10.1017/s0963548317000153","mag":"2175149620"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548317000153","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000153","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2DD0D54C5486DB2D9410DEBE50CBFE71/S0963548317000153a.pdf/div-class-title-on-the-maximum-number-of-spanning-copies-of-an-orientation-in-a-tournament-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2DD0D54C5486DB2D9410DEBE50CBFE71/S0963548317000153a.pdf/div-class-title-on-the-maximum-number-of-spanning-copies-of-an-orientation-in-a-tournament-div.pdf","any_repository_has_fulltext":true},"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 31905, Israel (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa 31905, Israel (e-mail:","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.4791,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49741697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"26","issue":"5","first_page":"775","last_page":"796"},"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.9998000264167786,"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.9998000264167786,"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/T11476","display_name":"Graph theory and applications","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9342516660690308},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8561149835586548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6587976813316345},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6297659277915955},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6229016184806824},{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.6155476570129395},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5803588032722473},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5475921034812927},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48136359453201294},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.46349453926086426},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45485806465148926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3099033236503601},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.17894774675369263},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.12049639225006104},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09605222940444946},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06906360387802124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0587162971496582}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9342516660690308},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8561149835586548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6587976813316345},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6297659277915955},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6229016184806824},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.6155476570129395},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5803588032722473},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5475921034812927},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48136359453201294},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.46349453926086426},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45485806465148926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3099033236503601},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17894774675369263},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.12049639225006104},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09605222940444946},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06906360387802124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0587162971496582},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548317000153","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000153","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2DD0D54C5486DB2D9410DEBE50CBFE71/S0963548317000153a.pdf/div-class-title-on-the-maximum-number-of-spanning-copies-of-an-orientation-in-a-tournament-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1511.07784","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.07784","pdf_url":"https://arxiv.org/pdf/1511.07784","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2175149620","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1511.07784.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1511.07784","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1511.07784","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":"doi:10.1017/s0963548317000153","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000153","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/2DD0D54C5486DB2D9410DEBE50CBFE71/S0963548317000153a.pdf/div-class-title-on-the-maximum-number-of-spanning-copies-of-an-orientation-in-a-tournament-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2175149620.pdf","grobid_xml":"https://content.openalex.org/works/W2175149620.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W34410737","https://openalex.org/W1504418244","https://openalex.org/W1510730180","https://openalex.org/W1554423888","https://openalex.org/W1571018443","https://openalex.org/W1991387851","https://openalex.org/W2036286064","https://openalex.org/W2051109444","https://openalex.org/W2073655059","https://openalex.org/W2087426219","https://openalex.org/W2088622619","https://openalex.org/W2159335922","https://openalex.org/W2303154786","https://openalex.org/W2627024531","https://openalex.org/W2952991443","https://openalex.org/W3213692093","https://openalex.org/W4243451311","https://openalex.org/W6601350494"],"related_works":["https://openalex.org/W2963826071","https://openalex.org/W2167942150","https://openalex.org/W2781654496","https://openalex.org/W2121888458","https://openalex.org/W2963460849","https://openalex.org/W2520601202","https://openalex.org/W2962739781","https://openalex.org/W2566811189","https://openalex.org/W2462722435","https://openalex.org/W2768216222","https://openalex.org/W2372648072","https://openalex.org/W3131830733","https://openalex.org/W2965928990","https://openalex.org/W3127518724","https://openalex.org/W2018169836","https://openalex.org/W2952341777","https://openalex.org/W2101614355","https://openalex.org/W2963640652","https://openalex.org/W2613342064","https://openalex.org/W3192388985"],"abstract_inverted_index":{"For":[0,58],"an":[1,23,77],"orientation":[2,220],"H":[3,10,21,34,41,64,75,91,188,221,228,241,252,265],"with":[4,222],"n":[5,24,37,59,78,94,103,109,111,124,130,132,143,223,237,248,261],"vertices,":[6],"let":[7,61],"T":[8,32,100,226],"(":[9,33,40,63,101,106,122,127,227,231,240,251,255,264],")":[11,35,42,65,104,125,229,242,253,266],"denote":[12,66],"the":[13,45,48,67,96,138,149,154,159],"maximum":[14,68],"possible":[15,69],"number":[16,50,70],"of":[17,20,51,71,74,186,207],"labelled":[18,72],"copies":[19,53,73],"in":[22,54,76,245],"-vertex":[25,79],"tournament.":[26,57,81],"It":[27],"is":[28,47,210],"easily":[29],"seen":[30],"that":[31,89,119,179,211],"\u2265":[36,105,126,230,254],"!/2":[38,110,131,238,262],"e":[39,232,239,256,263],",":[43,95,112,216,243],"as":[44,200,202],"latter":[46],"expected":[49],"such":[52],"a":[55,166,183],"random":[56],"odd,":[60,249],"R":[62,121,250],"regular":[80],"In":[82,145,169],"fact,":[83,246],"Adler,":[84],"Alon":[85,118],"and":[86,113,152,177,195,244],"Ross":[87],"proved":[88],"for":[90,137,148,182,212,247],"=":[92],"C":[93,102,123],"directed":[97,139],"Hamilton":[98,140,150],"cycle,":[99,153],"e\u2212o":[107,128],"(1))":[108,129,236,260],"it":[114],"was":[115],"observed":[116],"by":[117,165],"already":[120],".":[133,144,267],"Similar":[134],"results":[135],"hold":[136,181],"path":[141,151],"P":[142],"other":[146],"words,":[147],"lower":[155],"bound":[156],"derived":[157],"from":[158],"expectation":[160],"argument":[161],"can":[162],"be":[163],"improved":[164],"constant":[167],"factor.":[168],"this":[170],"paper":[171],"we":[172],"significantly":[173],"extend":[174],"these":[175],"results,":[176],"prove":[178],"they":[180],"larger":[184],"family":[185],"orientations":[187,194],"which":[189],"includes":[190],"all":[191,196],"bounded-degree":[192,197],"Eulerian":[193],"balanced":[198],"orientations,":[199],"well":[201],"many":[203],"others.":[204],"One":[205],"corollary":[206],"our":[208],"method":[209],"any":[213],"fixed":[214],"k":[215,218,233,257],"every":[217],"-regular":[219],"vertices":[224],"satisfies":[225],"\u2212":[234,258],"o":[235,259]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}