{"id":"https://openalex.org/W4395959840","doi":"https://doi.org/10.1017/s0963548324000142","title":"Tur\u00e1n problems in pseudorandom graphs","display_name":"Tur\u00e1n problems in pseudorandom graphs","publication_year":2024,"publication_date":"2024-04-29","ids":{"openalex":"https://openalex.org/W4395959840","doi":"https://doi.org/10.1017/s0963548324000142"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548324000142","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548324000142","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8510159104E6820D83FD3DD4C2901845/S0963548324000142a.pdf/div-class-title-turan-problems-in-pseudorandom-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8510159104E6820D83FD3DD4C2901845/S0963548324000142a.pdf/div-class-title-turan-problems-in-pseudorandom-graphs-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075876413","display_name":"Xizhi Liu","orcid":"https://orcid.org/0000-0002-0731-8084"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Xizhi Liu","raw_affiliation_strings":["Mathematics Institute and DIMAP, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Mathematics Institute and DIMAP, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079803922","display_name":"Dhruv Mubayi","orcid":"https://orcid.org/0000-0002-4709-8768"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dhruv Mubayi","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois, Chicago, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008819010","display_name":"David Munh\u00e1 Correia","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"David Munh\u00e1 Correia","raw_affiliation_strings":["Department of Mathematics, ETH, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, ETH, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075876413"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.2913,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70817781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"33","issue":"5","first_page":"583","last_page":"596"},"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.9995999932289124,"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.9995999932289124,"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/T11797","display_name":"graph theory and CDMA systems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9969000220298767,"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/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.8537476062774658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.738497257232666},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6081984639167786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5950281620025635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5864513516426086},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"Pseudorandomness","score":0.5483468770980835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5283282995223999},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5190908908843994},{"id":"https://openalex.org/keywords/pseudorandom-generator-theorem","display_name":"Pseudorandom generator theorem","score":0.4806172251701355},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.43139445781707764},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4259053170681},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4238876700401306},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23977798223495483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15027976036071777}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.8537476062774658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.738497257232666},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6081984639167786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5950281620025635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5864513516426086},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.5483468770980835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5283282995223999},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5190908908843994},{"id":"https://openalex.org/C180233235","wikidata":"https://www.wikidata.org/wiki/Q7255475","display_name":"Pseudorandom generator theorem","level":4,"score":0.4806172251701355},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.43139445781707764},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4259053170681},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4238876700401306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23977798223495483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15027976036071777},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548324000142","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548324000142","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8510159104E6820D83FD3DD4C2901845/S0963548324000142a.pdf/div-class-title-turan-problems-in-pseudorandom-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0963548324000142","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548324000142","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8510159104E6820D83FD3DD4C2901845/S0963548324000142a.pdf/div-class-title-turan-problems-in-pseudorandom-graphs-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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1944851705","display_name":null,"funder_award_id":"DMS-1763317","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4885109303","display_name":null,"funder_award_id":"1952767","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5694717120","display_name":null,"funder_award_id":"1763317","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7518142165","display_name":null,"funder_award_id":"2153576","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4395959840.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W95359580","https://openalex.org/W390146837","https://openalex.org/W1444168583","https://openalex.org/W1623354552","https://openalex.org/W1639593279","https://openalex.org/W1971162166","https://openalex.org/W1977374427","https://openalex.org/W1987996179","https://openalex.org/W2009852526","https://openalex.org/W2011869755","https://openalex.org/W2015922523","https://openalex.org/W2046756975","https://openalex.org/W2054037953","https://openalex.org/W2060431595","https://openalex.org/W2062496697","https://openalex.org/W2062670301","https://openalex.org/W2062748612","https://openalex.org/W2118360213","https://openalex.org/W2130270608","https://openalex.org/W2132317856","https://openalex.org/W2143122465","https://openalex.org/W2148275926","https://openalex.org/W2159703794","https://openalex.org/W2167283930","https://openalex.org/W2334104245","https://openalex.org/W2591824444","https://openalex.org/W2972248832","https://openalex.org/W3009277196","https://openalex.org/W3163234650","https://openalex.org/W4210755957","https://openalex.org/W4361799284","https://openalex.org/W4392447328","https://openalex.org/W6797465102"],"related_works":["https://openalex.org/W4241950541","https://openalex.org/W44435986","https://openalex.org/W2077146536","https://openalex.org/W4242117757","https://openalex.org/W2143898630","https://openalex.org/W2015880590","https://openalex.org/W2010238607","https://openalex.org/W4244556470","https://openalex.org/W2173196646","https://openalex.org/W2050598895"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,31,63,108],"graph":[3,16],"$F$":[4,22],",":[5],"we":[6,80,106],"consider":[7],"the":[8,12,45,66,70,75,83,94,112],"problem":[9],"of":[10,21,34,65,116],"determining":[11],"densest":[13,95,113],"possible":[14],"pseudorandom":[15,54,97,118],"that":[17,29,52,82,101,126],"contains":[18],"no":[19,129],"copy":[20,64],".":[23,78],"We":[24,91],"provide":[25],"an":[26,41],"embedding":[27],"procedure":[28],"improves":[30],"general":[32],"result":[33,50,73],"Conlon,":[35],"Fox,":[36],"and":[37,124],"Zhao":[38],"which":[39],"gives":[40,74],"upper":[42],"bound":[43,76,88],"on":[44],"density.":[46],"In":[47],"particular,":[48],"our":[49,87],"implies":[51],"optimally":[53],"graphs":[55,100,119],"with":[56],"density":[57],"greater":[58],"than":[59],"$n^{-1/3}$":[60],"must":[61],"contain":[62],"Peterson":[67],"graph,":[68],"while":[69],"previous":[71],"best":[72],"$n^{-1/4}$":[77],"Moreover,":[79],"conjecture":[81],"exponent":[84],"$1/3$":[85],"in":[86],"is":[89],"tight.":[90],"also":[92,103],"construct":[93],"known":[96,114],"$K_{2,3}$":[98],"-free":[99],"are":[102],"triangle-free.":[104],"Finally,":[105],"give":[107],"different":[109],"proof":[110],"for":[111],"construction":[115],"clique-free":[117],"due":[120],"to":[121],"Bishnoi,":[122],"Ihringer,":[123],"Pepe":[125],"they":[127],"have":[128],"large":[130],"clique.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2024-04-29T00:00:00"}