{"id":"https://openalex.org/W2165707420","doi":"https://doi.org/10.37236/2733","title":"Tur\u00e1n $H$-Densities for 3-Graphs","display_name":"Tur\u00e1n $H$-Densities for 3-Graphs","publication_year":2012,"publication_date":"2012-10-04","ids":{"openalex":"https://openalex.org/W2165707420","doi":"https://doi.org/10.37236/2733","mag":"2165707420"},"language":"en","primary_location":{"id":"doi:10.37236/2733","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2733","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i3p40/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/v19i3p40/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074450972","display_name":"Victor Falgas\u2010Ravry","orcid":"https://orcid.org/0000-0001-8631-4745"},"institutions":[{"id":"https://openalex.org/I90267481","display_name":"Ume\u00e5 University","ror":"https://ror.org/05kb8h459","country_code":"SE","type":"education","lineage":["https://openalex.org/I90267481"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Victor Falgas-Ravry","raw_affiliation_strings":["Institutionen f\u00f6r matematik och matematisk statistik, Ume\u00e5 Universitet"],"affiliations":[{"raw_affiliation_string":"Institutionen f\u00f6r matematik och matematisk statistik, Ume\u00e5 Universitet","institution_ids":["https://openalex.org/I90267481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031918862","display_name":"Emil R. Vaughan","orcid":null},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Emil R. Vaughan","raw_affiliation_strings":["School of Electronic Engineering and Computer Science, Queen Mary University of London"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering and Computer Science, Queen Mary University of London","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074450972"],"corresponding_institution_ids":["https://openalex.org/I90267481"],"apc_list":null,"apc_paid":null,"fwci":4.3575,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94845653,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"19","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.9994999766349792,"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.9994999766349792,"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.9034000039100647,"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.8909024596214294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7548000812530518},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.700213611125946},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.515377938747406},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.5078347325325012},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4259011149406433},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3789280652999878}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8909024596214294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7548000812530518},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.700213611125946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.515377938747406},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.5078347325325012},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4259011149406433},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3789280652999878},{"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.37236/2733","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2733","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i3p40/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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.761.5030","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.761.5030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1201.4326.pdf","raw_type":"text"},{"id":"pmh:oai:DiVA.org:umu-61562","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-61562","pdf_url":null,"source":{"id":"https://openalex.org/S4306400361","display_name":"DiVA at Ume\u00e5 University (Ume\u00e5 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I90267481","host_organization_name":"Ume\u00e5 University","host_organization_lineage":["https://openalex.org/I90267481"],"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":"","raw_type":"Article in journal"}],"best_oa_location":{"id":"doi:10.37236/2733","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2733","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i3p40/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":[{"id":"https://openalex.org/G6795580007","display_name":"Information flows and Information bottlenecks in Network Coding","funder_award_id":"EP/H016015/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320316838","display_name":"Kempe Foundation","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2165707420.pdf","grobid_xml":"https://content.openalex.org/works/W2165707420.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W109926980","https://openalex.org/W1649261915","https://openalex.org/W1932085276","https://openalex.org/W2004751842","https://openalex.org/W2013425391","https://openalex.org/W2025617285","https://openalex.org/W2029849517","https://openalex.org/W2031135370","https://openalex.org/W2034871182","https://openalex.org/W2041193896","https://openalex.org/W2078816665","https://openalex.org/W2088584953","https://openalex.org/W2090798615","https://openalex.org/W2099921939","https://openalex.org/W2102204848","https://openalex.org/W2104509227","https://openalex.org/W2112317227","https://openalex.org/W2141747807","https://openalex.org/W2152415608","https://openalex.org/W2168244850","https://openalex.org/W2275896343","https://openalex.org/W2498848698","https://openalex.org/W2949177194","https://openalex.org/W2953118316","https://openalex.org/W3098813812","https://openalex.org/W3101815764","https://openalex.org/W4237260061","https://openalex.org/W4255941684","https://openalex.org/W4293403064","https://openalex.org/W4300814293","https://openalex.org/W4301937539","https://openalex.org/W6603102344","https://openalex.org/W6610169696","https://openalex.org/W6611252610","https://openalex.org/W6758382962"],"related_works":["https://openalex.org/W3194471551","https://openalex.org/W4375956809","https://openalex.org/W1581373162","https://openalex.org/W2784911598","https://openalex.org/W4297950433","https://openalex.org/W4287023968","https://openalex.org/W4288279572","https://openalex.org/W1973978937","https://openalex.org/W4286909116","https://openalex.org/W4292635168"],"abstract_inverted_index":{"Given":[0],"an":[1,29,57,204],"$r$-graph":[2,31],"$H$":[3,27,55],"on":[4,32,115,128,183,189,220],"$h$":[5],"vertices,":[6],"and":[7,59,110,164,168,218,234],"a":[8,102,105,112,143,159,214],"family":[9],"$\\mathcal{F}$":[10,40,62],"of":[11,23,26,39,51,67,118,161,174,216,224],"forbidden":[12],"subgraphs,":[13],"we":[14,91],"define":[15],"$\\mathrm{ex}_{H}(n,":[16],"\\mathcal{F})$":[17],"to":[18,83,213],"be":[19,180],"the":[20,36,42,49,116,126,172,181,187,199,221,225],"maximum":[21],"number":[22,160],"induced":[24],"copies":[25],"in":[28,104,138,154,169],"$\\mathcal{F}$-free":[30],"$n$":[33],"vertices.":[34],"Then":[35],"Tur\u00e1n":[37,52,85,222],"$H$-density":[38],"is":[41,56,63,211],"limit\\[\\pi_{H}(\\mathcal{F})=":[43],"\\lim_{n\\rightarrow":[44],"\\infty}\\mathrm{ex}_{H}(n,":[45],"\\mathcal{F})/\\binom{n}{h}.":[46],"\\]This":[47],"generalises":[48],"notions":[50],"density":[53,223],"(when":[54,61],"$r$-edge),":[58],"inducibility":[60,173],"empty).":[64],"Although":[65],"problems":[66],"this":[68,139],"kind":[69],"have":[70],"received":[71],"some":[72],"attention,":[73],"very":[74],"few":[75],"results":[76,163],"are":[77],"known.We":[78],"use":[79],"Razborov's":[80],"semi-definite":[81],"method":[82],"investigate":[84],"$H$-densities":[86],"for":[87,108,166,238],"$3$-graphs.":[88],"In":[89],"particular,":[90],"show":[92,202],"that\\[\\pi_{K_4^-}(K_4)":[93],"=":[94],"16/27,\\]with":[95],"Tur\u00e1n's":[96],"construction":[97,146,207],"being":[98,208],"optimal.":[99],"We":[100,120,157,201,228],"prove":[101],"result":[103],"similar":[106],"flavour":[107],"$K_5$":[109],"make":[111],"general":[113,239],"conjecture":[114,215,235],"value":[117,237],"$\\pi_{K_t^-}(K_t)$.":[119],"also":[121,229],"establish":[122],"that\\[\\pi_{4.2}(\\emptyset)=3/4,\\]where":[123],"$4.2$":[124],"denotes":[125],"$3$-graph":[127,155],"$4$":[129],"vertices":[130,191],"with":[131,192],"exactly":[132],"$2$":[133],"edges.":[134],"The":[135],"lower":[136],"bound":[137],"case":[140],"comes":[141],"from":[142,149,198],"random":[144],"geometric":[145],"strikingly":[147],"different":[148],"previous":[150],"known":[151],"extremal":[152],"examples":[153],"theory.":[156],"give":[158],"other":[162],"conjectures":[165],"$3$-graphs,":[167],"addition":[170],"consider":[171],"certain":[175],"directed":[176],"graphs.":[177],"Let":[178],"$\\vec{S}_k$":[179],"out-star":[182],"$k$":[184,190],"vertices;":[185],"i.e.":[186],"star":[188],"all":[193],"$k-1$":[194],"edges":[195],"oriented":[196],"away":[197],"centre.":[200],"that\\[\\pi_{\\vec{S}_3}(\\emptyset)=2\\sqrt{3}-3,\\]with":[203],"iterated":[205],"blow-up":[206],"extremal.":[209],"This":[210],"related":[212],"Mubayi":[217],"R\u00f6dl":[219],"3-graph":[226],"$C_5$.":[227],"determine":[230],"$\\pi_{\\vec{S}_k}(\\emptyset)$":[231],"when":[232],"$k=4,5$,":[233],"its":[236],"$k$.":[240]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}