{"id":"https://openalex.org/W2144617069","doi":"https://doi.org/10.1017/s0963548312000454","title":"Hypergraph Independent Sets","display_name":"Hypergraph Independent Sets","publication_year":2012,"publication_date":"2012-10-11","ids":{"openalex":"https://openalex.org/W2144617069","doi":"https://doi.org/10.1017/s0963548312000454","mag":"2144617069"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000454","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000454","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3586B58E2548F72F9FB10C8BCF43E179/S0963548312000454a.pdf/div-class-title-hypergraph-independent-sets-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":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3586B58E2548F72F9FB10C8BCF43E179/S0963548312000454a.pdf/div-class-title-hypergraph-independent-sets-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010808215","display_name":"Jonathan Cutler","orcid":null},"institutions":[{"id":"https://openalex.org/I166088655","display_name":"Montclair State University","ror":"https://ror.org/01nxc2t48","country_code":"US","type":"education","lineage":["https://openalex.org/I166088655"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JONATHAN CUTLER","raw_affiliation_strings":["Department of Mathematical Sciences, Montclair State University, Montclair, NJ 07043, USA (e-mail:","Department of mathematical sciences, montclair state university, montclair, nj 07043, usa e-mail: jonathan.cutler@montclair.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Montclair State University, Montclair, NJ 07043, USA (e-mail:","institution_ids":["https://openalex.org/I166088655"]},{"raw_affiliation_string":"Department of mathematical sciences, montclair state university, montclair, nj 07043, usa e-mail: jonathan.cutler@montclair.edu#TAB#","institution_ids":["https://openalex.org/I166088655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032520716","display_name":"A. J. Radcliffe","orcid":"https://orcid.org/0000-0002-8817-0383"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. J. RADCLIFFE","raw_affiliation_strings":["Department of Mathematics, University of Nebraska\u2013Lincoln, Lincoln, NE 68588-0130, USA (e-mail:","Department of mathematics, university of nebraska-lincoln, lincoln, ne 68588-0130, usa e-mail: aradcliffe1@math.unl.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Nebraska\u2013Lincoln, Lincoln, NE 68588-0130, USA (e-mail:","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Department of mathematics, university of nebraska-lincoln, lincoln, ne 68588-0130, usa e-mail: aradcliffe1@math.unl.edu#TAB#","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9681,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.73924122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"1","first_page":"9","last_page":"20"},"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.9990000128746033,"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.9990000128746033,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9818999767303467,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9764999747276306,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/hypergraph","display_name":"Hypergraph","score":0.9774066209793091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.774294376373291},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.740150511264801},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.7368233799934387},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.603550136089325},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5411787033081055},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5261765718460083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4691055417060852},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4657832980155945},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4323924779891968},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10506811738014221},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1008715033531189}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9774066209793091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.774294376373291},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.740150511264801},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.7368233799934387},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.603550136089325},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5411787033081055},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5261765718460083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4691055417060852},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4657832980155945},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4323924779891968},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10506811738014221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1008715033531189},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548312000454","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000454","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3586B58E2548F72F9FB10C8BCF43E179/S0963548312000454a.pdf/div-class-title-hypergraph-independent-sets-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:digitalcommons.unl.edu:mathfacpub-1076","is_oa":false,"landing_page_url":"https://digitalcommons.unl.edu/mathfacpub/72","pdf_url":null,"source":{"id":"https://openalex.org/S4306400577","display_name":"Lincoln (University of Nebraska)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114395901","host_organization_name":"University of Nebraska\u2013Lincoln","host_organization_lineage":["https://openalex.org/I114395901"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematics: Faculty Publications","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.1393","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.1393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unl.edu/%7Earadcliffe1/Papers/HypInd.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1017/s0963548312000454","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548312000454","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/3586B58E2548F72F9FB10C8BCF43E179/S0963548312000454a.pdf/div-class-title-hypergraph-independent-sets-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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2144617069.pdf","grobid_xml":"https://content.openalex.org/works/W2144617069.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1534511119","https://openalex.org/W1986646471","https://openalex.org/W2011367822","https://openalex.org/W2058870462","https://openalex.org/W2072858942","https://openalex.org/W2076452042","https://openalex.org/W2100842600","https://openalex.org/W2105457218","https://openalex.org/W2116537669","https://openalex.org/W2143456215","https://openalex.org/W2148795954","https://openalex.org/W2149054878","https://openalex.org/W2153710291","https://openalex.org/W2164181738","https://openalex.org/W3104688290","https://openalex.org/W3136243343"],"related_works":["https://openalex.org/W2950157558","https://openalex.org/W2983505768","https://openalex.org/W2176262501","https://openalex.org/W1515688014","https://openalex.org/W4295571831","https://openalex.org/W2085708731","https://openalex.org/W2949363099","https://openalex.org/W2163453622","https://openalex.org/W2526197252","https://openalex.org/W2964134489"],"abstract_inverted_index":{"The":[0,66],"study":[1],"of":[2,23,25,34,49,124],"extremal":[3],"problems":[4],"related":[5],"to":[6,113],"independent":[7,26,38],"sets":[8,27,89,127],"in":[9,28,41,71,128],"hypergraphs":[10,29],"is":[11,51,90],"a":[12,21,47,77,99,105],"problem":[13],"that":[14,46,70],"has":[15,59],"generated":[16],"much":[17],"interest.":[18],"There":[19],"are":[20],"variety":[22],"types":[24],"depending":[30],"on":[31,121],"the":[32,82,85,91,122],"number":[33,123],"vertices":[35,50],"from":[36],"an":[37,42,72,115,129],"set":[39],"allowed":[40],"edge.":[43],"We":[44],"say":[45],"subset":[48],"j-independent":[52],"if":[53],"its":[54],"intersection":[55],"with":[56,76,84,104],"any":[57],"edge":[58],"size":[60,79],"strictly":[61],"less":[62],"than":[63],"j":[64,125],".":[65],"Kruskal\u2013Katona":[67],"theorem":[68],"implies":[69],"r":[73,87,130],"-uniform":[74,131],"hypergraph":[75,83,100],"fixed":[78],"and":[80,111],"order,":[81],"most":[86],"-independent":[88,126],"lexicographic":[92],"hypergraph.":[93,132],"In":[94],"this":[95],"paper,":[96],"we":[97],"use":[98],"regularity":[101],"lemma,":[102],"along":[103],"technique":[106],"developed":[107],"by":[108],"Loh,":[109],"Pikhurko":[110],"Sudakov,":[112],"give":[114],"asymptotically":[116],"best":[117],"possible":[118],"upper":[119],"bound":[120]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}