{"id":"https://openalex.org/W2762992850","doi":"https://doi.org/10.1017/s0963548315000334","title":"The Multiple-Orientability Thresholds for Random Hypergraphs","display_name":"The Multiple-Orientability Thresholds for Random Hypergraphs","publication_year":2015,"publication_date":"2015-12-28","ids":{"openalex":"https://openalex.org/W2762992850","doi":"https://doi.org/10.1017/s0963548315000334","mag":"2762992850"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548315000334","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548315000334","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A6ED335A0C90E5DBEC6D1DFBCF0D674B/S0963548315000334a.pdf/div-class-title-the-multiple-orientability-thresholds-for-random-hypergraphs-a-href-afn1-ref-type-fn-span-class-sup-span-a-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"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A6ED335A0C90E5DBEC6D1DFBCF0D674B/S0963548315000334a.pdf/div-class-title-the-multiple-orientability-thresholds-for-random-hypergraphs-a-href-afn1-ref-type-fn-span-class-sup-span-a-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"NIKOLAOS FOUNTOULAKIS","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"NIKOLAOS FOUNTOULAKIS","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, B15 2TT, UK (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, B15 2TT, UK (e-mail:","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":null,"display_name":"MEGHA KHOSLA","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MEGHA KHOSLA","raw_affiliation_strings":["Max Planck Institute for Informatics, Campus E1 4, 66123 Saarbr\u00fccken, Germany (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Campus E1 4, 66123 Saarbr\u00fccken, Germany (e-mail:","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":null,"display_name":"KONSTANTINOS PANAGIOTOU","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"KONSTANTINOS PANAGIOTOU","raw_affiliation_strings":["Mathematics Institute, University of Munich, Theresienstr. 39, 80333 M\u00fcnchen, Germany (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Institute, University of Munich, Theresienstr. 39, 80333 M\u00fcnchen, Germany (e-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6581,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.71591794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"6","first_page":"870","last_page":"908"},"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.6366999745368958,"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.6366999745368958,"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.1543000042438507,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0430000014603138,"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/set","display_name":"Set (abstract data type)","score":0.504800021648407},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4959000051021576},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.31630000472068787},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.3084999918937683},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29809999465942383}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6281999945640564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5839999914169312},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.504800021648407},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4959000051021576},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4433000087738037},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3086000084877014},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3084999918937683},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25060001015663147}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548315000334","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548315000334","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A6ED335A0C90E5DBEC6D1DFBCF0D674B/S0963548315000334a.pdf/div-class-title-the-multiple-orientability-thresholds-for-random-hypergraphs-a-href-afn1-ref-type-fn-span-class-sup-span-a-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:1309.6772","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1309.6772","pdf_url":"https://arxiv.org/pdf/1309.6772","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:epub.ub.uni-muenchen.de:47315","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bvb:19-epub-47315-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401845","display_name":"Open access LMU (Ludwid Maxmilian's Universitat Munchen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8204097","host_organization_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","host_organization_lineage":["https://openalex.org/I8204097"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics Probability & Computing","raw_type":"doc-type:article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/70850870-9d87-47f7-92f1-80d7468a60eb","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/70850870-9d87-47f7-92f1-80d7468a60eb","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fountoulakis, N, Khosla, M & Panagiotou, K 2015, 'The multiple-orientability thresholds for random hypergraphs', Combinatorics, Probability and Computing, vol. 25, no. 6, pp. 870-908. https://doi.org/10.1017/S0963548315000334","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s0963548315000334","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548315000334","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A6ED335A0C90E5DBEC6D1DFBCF0D674B/S0963548315000334a.pdf/div-class-title-the-multiple-orientability-thresholds-for-random-hypergraphs-a-href-afn1-ref-type-fn-span-class-sup-span-a-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/W2762992850.pdf","grobid_xml":"https://content.openalex.org/works/W2762992850.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1757513105","https://openalex.org/W1973494188","https://openalex.org/W1987102081","https://openalex.org/W1997698259","https://openalex.org/W2008159222","https://openalex.org/W2080908560","https://openalex.org/W2091476183","https://openalex.org/W2478722229","https://openalex.org/W2952096314","https://openalex.org/W4243384247","https://openalex.org/W4253819323","https://openalex.org/W4255148642"],"related_works":[],"abstract_inverted_index":{"A":[0],"k":[1,57,81],"-uniform":[2,58],"hypergraph":[3],"H":[4,43,77,107],"=":[5],"(":[6],"V,":[7],"E":[8,23],")":[9],"is":[10,15,36],"called":[11],"\u2113-orientable":[12],"if":[13,112,123],"there":[14],"an":[16,110],"assignment":[17],"of":[18,26,55,76],"each":[19],"edge":[20],"e":[21,31],"\u2208":[22,30],"to":[24,120,151],"one":[25],"its":[27],"vertices":[28,62],"v":[29],"such":[32,97],"that":[33,88,98],"no":[34],"vertex":[35],"assigned":[37],"more":[38],"than":[39],"\u2113":[40,85],"edges.":[41,65],"Let":[42],"n,m,k":[44,78],"be":[45],"a":[46,92],"hypergraph,":[47],"drawn":[48],"uniformly":[49],"at":[50],"random":[51],"from":[52],"the":[53,71,74,105],"set":[54],"all":[56,80],"hypergraphs":[59],"with":[60,99,143],"n":[61],"and":[63,84,147],"m":[64],"In":[66],"this":[67],"paper":[68],"we":[69,90],"establish":[70],"threshold":[72],"for":[73,79,138],"\u2113-orientability":[75],"\u2a7e":[82,86],"3":[83],"2,":[87],"is,":[89],"determine":[91],"critical":[93],"quantity":[94],"c*":[95,115,126],"k,\u2113":[96,116,127],"probability":[100],"1":[101],"\u2212":[102],"o":[103],"(1)":[104],"graph":[106],"n,cn,k":[108],"has":[109,131],"\u2113-orientation":[111],"c":[113,124],"<":[114],",":[117],"but":[118],"fails":[119],"do":[121],"so":[122],">":[125],".":[128],"Our":[129],"result":[130],"various":[132],"applications,":[133],"including":[134],"sharp":[135],"load":[136,141],"thresholds":[137],"cuckoo":[139],"hashing,":[140],"balancing":[142],"guaranteed":[144],"maximum":[145],"load,":[146],"massive":[148],"parallel":[149],"access":[150],"hard":[152],"disk":[153],"arrays.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2017-10-20T00:00:00"}