{"id":"https://openalex.org/W1564409139","doi":"https://doi.org/10.37236/2736","title":"Maximal Antichains of Minimum Size","display_name":"Maximal Antichains of Minimum Size","publication_year":2013,"publication_date":"2013-04-09","ids":{"openalex":"https://openalex.org/W1564409139","doi":"https://doi.org/10.37236/2736","mag":"1564409139"},"language":"en","primary_location":{"id":"doi:10.37236/2736","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2736","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i2p3/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/v20i2p3/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065831321","display_name":"Thomas Kalinowski","orcid":"https://orcid.org/0000-0002-8444-6848"},"institutions":[{"id":"https://openalex.org/I4665924","display_name":"University of Rostock","ror":"https://ror.org/03zdwsf69","country_code":"DE","type":"education","lineage":["https://openalex.org/I4665924"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Kalinowski","raw_affiliation_strings":["Universit\u00e4t Rostock"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Rostock","institution_ids":["https://openalex.org/I4665924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005800370","display_name":"Uwe Leck","orcid":"https://orcid.org/0000-0002-0064-9112"},"institutions":[{"id":"https://openalex.org/I61567134","display_name":"University of Wisconsin\u2013Superior","ror":"https://ror.org/00z2qhk53","country_code":"US","type":"education","lineage":["https://openalex.org/I61567134"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uwe Leck","raw_affiliation_strings":["University of Wisconsin-Superior","University of Wisconsin, Superior,"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Superior","institution_ids":["https://openalex.org/I61567134"]},{"raw_affiliation_string":"University of Wisconsin, Superior,","institution_ids":["https://openalex.org/I61567134"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019826020","display_name":"Ian T. Roberts","orcid":null},"institutions":[{"id":"https://openalex.org/I110995367","display_name":"Sprint (United States)","ror":"https://ror.org/04rxdpa15","country_code":"US","type":"company","lineage":["https://openalex.org/I110995367"]},{"id":"https://openalex.org/I29894533","display_name":"Charles Darwin University","ror":"https://ror.org/048zcaj52","country_code":"AU","type":"education","lineage":["https://openalex.org/I29894533"]}],"countries":["AU","US"],"is_corresponding":false,"raw_author_name":"Ian T. Roberts","raw_affiliation_strings":["P.O. Box 40611 Casuarina, NT Australia 0811","Charles Darwin University"],"affiliations":[{"raw_affiliation_string":"P.O. Box 40611 Casuarina, NT Australia 0811","institution_ids":["https://openalex.org/I110995367"]},{"raw_affiliation_string":"Charles Darwin University","institution_ids":["https://openalex.org/I29894533"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065831321"],"corresponding_institution_ids":["https://openalex.org/I4665924"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.03507825,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"20","issue":"2","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.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/T10374","display_name":"Advanced Graph Theory Research","score":0.9947999715805054,"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/T11476","display_name":"Graph theory and applications","score":0.9900000095367432,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.9119042158126831},{"id":"https://openalex.org/keywords/antichain","display_name":"Antichain","score":0.8502652645111084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8082777261734009},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6848768591880798},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5599648356437683},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5411038398742676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48464328050613403},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43503454327583313},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4239242374897003},{"id":"https://openalex.org/keywords/partially-ordered-set","display_name":"Partially ordered set","score":0.3211243450641632},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06424736976623535}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9119042158126831},{"id":"https://openalex.org/C136134351","wikidata":"https://www.wikidata.org/wiki/Q431937","display_name":"Antichain","level":3,"score":0.8502652645111084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8082777261734009},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6848768591880798},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5599648356437683},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5411038398742676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48464328050613403},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43503454327583313},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4239242374897003},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.3211243450641632},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06424736976623535},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/2736","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2736","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i2p3/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"}],"best_oa_location":{"id":"doi:10.37236/2736","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2736","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i2p3/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1564409139.pdf","grobid_xml":"https://content.openalex.org/works/W1564409139.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1519761499","https://openalex.org/W1544735579","https://openalex.org/W1981663372","https://openalex.org/W2011575706","https://openalex.org/W2068518716","https://openalex.org/W2078321205","https://openalex.org/W2093276208","https://openalex.org/W2098427027","https://openalex.org/W2164542539","https://openalex.org/W2914735434","https://openalex.org/W4293245583"],"related_works":["https://openalex.org/W2013313833","https://openalex.org/W28336341","https://openalex.org/W2111205855","https://openalex.org/W2015816871","https://openalex.org/W1854642140","https://openalex.org/W2056881277","https://openalex.org/W2065333210","https://openalex.org/W1504624230","https://openalex.org/W3213974985","https://openalex.org/W4302107529"],"abstract_inverted_index":{"Let":[0],"$n\\geqslant":[1],"4$":[2],"be":[3,10,97],"a":[4,11,26,58,85,107],"natural":[5],"number,":[6],"and":[7,45,104],"let":[8],"$K$":[9,66],"set":[12],"$K\\subseteq":[13],"[n]:=\\{1,2,\\dots,n\\}$.":[14],"We":[15,56,92],"study":[16],"the":[17,21,79,111,121,130],"problem":[18,131],"of":[19,25,30,32,61,83,120,129],"finding":[20],"smallest":[22,80],"possible":[23,81],"size":[24,41,82],"maximal":[27],"family":[28],"$\\mathcal{A}$":[29,36,52],"subsets":[31],"$[n]$":[33],"such":[34,62,84],"that":[35],"contains":[37],"only":[38],"sets":[39,65],"whose":[40],"is":[42,53,137],"in":[43,132,139],"$K$,":[44],"$A\\not\\subseteq":[46],"B$":[47],"for":[48,64,101,110],"all":[49],"$\\{A,B\\}\\subseteq\\mathcal{A}$,":[50],"i.e.":[51],"an":[54,89,126],"antichain.":[55],"present":[57],"general":[59],"construction":[60,76,95],"antichains":[63],"containing":[67],"2,":[68],"but":[69],"not":[70],"1.":[71],"If":[72],"$3\\in":[73],"K$":[74],"our":[75,94],"asymptotically":[77,98],"yields":[78],"family,":[86],"up":[87],"to":[88,96,125],"$o(n^2)$":[90],"error.":[91],"conjecture":[93],"optimal":[99],"also":[100],"$3\\not\\in":[102],"K$,":[103],"we":[105],"prove":[106],"weaker":[108],"bound":[109],"case":[112],"$K=\\{2,4\\}$.":[113],"Our":[114],"asymptotic":[115],"results":[116],"are":[117],"straightforward":[118],"applications":[119],"graph":[122,134],"removal":[123],"lemma":[124],"equivalent":[127],"reformulation":[128],"extremal":[133],"theory,":[135],"which":[136],"interesting":[138],"its":[140],"own":[141],"right.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}