{"id":"https://openalex.org/W1983466687","doi":"https://doi.org/10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","title":"Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture","display_name":"Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1983466687","doi":"https://doi.org/10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","mag":"1983466687"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031575825","display_name":"Fr\u00e9d\u00e9ric Havet","orcid":"https://orcid.org/0000-0002-3447-8112"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fr\ufffdd\ufffdric Havet","raw_affiliation_strings":["Laboratoire LAPCS, UFR de Mathe\u0301matiques, Universite\u0301 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France","Laboratoire LAPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire LAPCS, UFR de Mathe\u0301matiques, Universite\u0301 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France","institution_ids":["https://openalex.org/I100532134"]},{"raw_affiliation_string":"Laboratoire LAPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France#TAB#","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033238040","display_name":"St\u00e9phan Thomass\u00e9","orcid":"https://orcid.org/0000-0002-7090-1790"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\ufffdphan Thomass\ufffd","raw_affiliation_strings":["Laboratoire LAPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire LAPCS, UFR de Math\u00e9matiques, Universit\u00e9 Claude Bernard, 43, Boulevard du 11 Novembre 1918, 69622 Villeurbanne Cedex, France#TAB#","institution_ids":["https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031575825"],"corresponding_institution_ids":["https://openalex.org/I100532134"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":1.8618,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.84597581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"35","issue":"4","first_page":"244","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9711999893188477,"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.9711999893188477,"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.9538999795913696,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9412000179290771,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9802250266075134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.856191098690033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.83342444896698},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.753007709980011},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7265428900718689},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.6589089035987854},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5728182196617126},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5597323775291443},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47022390365600586},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4493393003940582},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40030261874198914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08153244853019714}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9802250266075134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.856191098690033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.83342444896698},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.753007709980011},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7265428900718689},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.6589089035987854},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5728182196617126},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5597323775291443},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47022390365600586},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4493393003940582},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40030261874198914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08153244853019714},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0118(200012)35:4<244::aid-jgt2>3.0.co;2-h","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"},{"id":"mag:1983466687","is_oa":false,"landing_page_url":"http://kam.mff.cuni.cz/kseminar/clanky/HavetT-Sumner-conj.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Graph Theory","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W61412736","https://openalex.org/W1965752728","https://openalex.org/W2006024738","https://openalex.org/W2045793488","https://openalex.org/W2065747108","https://openalex.org/W2971402442","https://openalex.org/W4250951991"],"related_works":["https://openalex.org/W2065747108","https://openalex.org/W2006024738","https://openalex.org/W2103630422","https://openalex.org/W2016910331","https://openalex.org/W1963946273","https://openalex.org/W3103832149","https://openalex.org/W2971402442","https://openalex.org/W2039068577","https://openalex.org/W3160867079","https://openalex.org/W1990037810","https://openalex.org/W3147522373","https://openalex.org/W3122319259","https://openalex.org/W1976444262","https://openalex.org/W61412736","https://openalex.org/W60957894","https://openalex.org/W1973167211","https://openalex.org/W2003732634","https://openalex.org/W2126701551","https://openalex.org/W2085877663","https://openalex.org/W2018724658"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,7,14,72],"short":[3],"constructive":[4],"proof":[5,41],"of":[6,9,44,50,57,65,75,80,89,102,111],"theorem":[8],"Fisher:":[10],"every":[11,55,63,78,86,100,108],"tournament":[12,35,56,79,101],"contains":[13,62,85,107],"vertex":[15],"whose":[16],"second":[17,48],"outneighborhood":[18],"is":[19,53,71],"as":[20,22],"large":[21],"its":[23],"first":[24],"outneighborhood.":[25],"Moreover,":[26],"we":[27,97],"exhibit":[28],"two":[29],"such":[30],"vertices":[31],"provided":[32],"that":[33,54,99],"the":[34],"has":[36],"no":[37],"dominated":[38],"vertex.":[39],"The":[40],"makes":[42],"use":[43],"median":[45,51],"orders.":[46],"A":[47],"application":[49],"orders":[52],"order":[58,66,81,90,103,112],"2n":[59,82],"\u2212":[60,83,105],"2":[61,84],"arborescence":[64],"n":[67,91],">":[68,92],"1.":[69,93],"This":[70],"particular":[73],"case":[74],"Sumner's":[76],"conjecture:":[77],"oriented":[87,109],"tree":[88,110],"Using":[94],"our":[95],"method,":[96],"prove":[98],"(7n":[104],"5)/2":[106],"n.":[113],"\u00a9":[114],"2000":[115,126],"John":[116],"Wiley":[117],"&":[118],"Sons,":[119],"Inc.":[120],"J":[121],"Graph":[122],"Theory":[123],"35:":[124],"244\u2013256,":[125]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}