{"id":"https://openalex.org/W1798827042","doi":"https://doi.org/10.37236/4136","title":"On Saturated $k$-Sperner Systems","display_name":"On Saturated $k$-Sperner Systems","publication_year":2014,"publication_date":"2014-08-13","ids":{"openalex":"https://openalex.org/W1798827042","doi":"https://doi.org/10.37236/4136","mag":"1798827042"},"language":"en","primary_location":{"id":"doi:10.37236/4136","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4136","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i3p22/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/v21i3p22/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113957266","display_name":"Natasha Morrison","orcid":null},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Natasha Morrison","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050636348","display_name":"Jonathan A. Noel","orcid":"https://orcid.org/0000-0002-8281-8249"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jonathan A. Noel","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045091550","display_name":"Alex Scott","orcid":"https://orcid.org/0000-0003-4489-5988"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alex Scott","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":4.8199,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.95222743,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"21","issue":"3","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.9998999834060669,"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.9998999834060669,"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.9965999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9854000210762024,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8405802845954895},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7926331162452698},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7309867143630981},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6808609962463379},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49557554721832275},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08634287118911743}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8405802845954895},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7926331162452698},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7309867143630981},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6808609962463379},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49557554721832275},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08634287118911743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/4136","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4136","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i3p22/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/4136","is_oa":true,"landing_page_url":"https://doi.org/10.37236/4136","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i3p22/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":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1798827042.pdf","grobid_xml":"https://content.openalex.org/works/W1798827042.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W185109540","https://openalex.org/W1976198431","https://openalex.org/W1981663372","https://openalex.org/W1990490082","https://openalex.org/W1992511794","https://openalex.org/W1998090738","https://openalex.org/W2008544632","https://openalex.org/W2014485295","https://openalex.org/W2062088180","https://openalex.org/W2087567316","https://openalex.org/W2094522815","https://openalex.org/W2161173317","https://openalex.org/W2161815929","https://openalex.org/W2949217681","https://openalex.org/W3100311241","https://openalex.org/W3102259815","https://openalex.org/W3179424942","https://openalex.org/W6603102344","https://openalex.org/W6646050465"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2002177687","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W4287273005","https://openalex.org/W3135784370","https://openalex.org/W2776473626","https://openalex.org/W1966028935"],"abstract_inverted_index":{"Given":[0],"a":[1,4,17,57,85,153],"set":[2,23],"$X$,":[3],"collection":[5,95,131],"$\\mathcal{F}\\subseteq\\mathcal{P}(X)$":[6,61,89],"is":[7,27,31,45,62,98,148],"said":[8,99],"to":[9,35,50,100,152],"be":[10,101],"$k$-Sperner":[11,59,87,104],"if":[12,29,43,124,141],"it":[13,26,30],"does":[14],"not":[15],"contain":[16],"chain":[18],"of":[19,56,114],"length":[20,115],"$k+1$":[21,116],"under":[22],"inclusion":[24],"and":[25,79,135],"saturated":[28,58,86],"maximal":[32],"with":[33,48,90],"respect":[34,49],"this":[36,66],"property.":[37],"Gerbner":[38,119],"et":[39,120],"al.":[40,121],"conjectured":[41],"that,":[42,123],"$|X|$":[44],"sufficiently":[46],"large":[47],"$k$,":[51],"then":[52,127,144],"the":[53,128,145],"minimum":[54],"size":[55],"system":[60,88,105],"$2^{k-1}$.":[63],"We":[64,138],"disprove":[65],"conjecture":[67],"by":[68],"showing":[69],"that":[70,75,140],"there":[71,83],"exists":[72,84],"$\\varepsilon>0$":[73],"such":[74,130],"for":[76,107],"every":[77,108],"$k$":[78],"$|X|":[80],"\\geq":[81],"n_0(k)$":[82],"cardinality":[91],"at":[92],"most":[93],"$2^{(1-\\varepsilon)k}$.A":[94],"$\\mathcal{F}\\subseteq":[96],"\\mathcal{P}(X)$":[97],"an":[102],"oversaturated":[103],"if,":[106],"$S\\in\\mathcal{P}(X)\\setminus\\mathcal{F}$,":[109],"$\\mathcal{F}\\cup\\{S\\}$":[110],"contains":[111,132],"more":[112],"chains":[113],"than":[117],"$\\mathcal{F}$.":[118],"proved":[122],"$|X|\\geq":[125,142],"k$,":[126],"smallest":[129],"between":[133],"$2^{k/2-1}$":[134],"$O\\left(\\frac{\\log{k}}{k}2^k\\right)$":[136],"elements.":[137],"show":[139],"k^2+k$,":[143],"lower":[146],"bound":[147],"best":[149],"possible,":[150],"up":[151],"polynomial":[154],"factor.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}