{"id":"https://openalex.org/W2007709851","doi":"https://doi.org/10.1017/s0963548312000508","title":"Applications of the Semi-Definite Method to the Tur\u00e1n Density Problem for 3-Graphs","display_name":"Applications of the Semi-Definite Method to the Tur\u00e1n Density Problem for 3-Graphs","publication_year":2012,"publication_date":"2012-12-07","ids":{"openalex":"https://openalex.org/W2007709851","doi":"https://doi.org/10.1017/s0963548312000508","mag":"2007709851"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000508","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000508","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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":false,"raw_author_name":"VICTOR FALGAS-RAVRY","raw_affiliation_strings":["Institutionen f\u00f6r matematik och matematisk statistik, Ume\u00e5 Universitet, 901 87 Ume\u00e5, Sweden (e-mail:","Institutionen f\u00f6r matematik och matematisk statistik, ume\u00e5 universitet, 901 87 ume\u00e5, sweden e-mail: victor.falgas-ravry@math.umu.se#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institutionen f\u00f6r matematik och matematisk statistik, Ume\u00e5 Universitet, 901 87 Ume\u00e5, Sweden (e-mail:","institution_ids":["https://openalex.org/I90267481"]},{"raw_affiliation_string":"Institutionen f\u00f6r matematik och matematisk statistik, ume\u00e5 universitet, 901 87 ume\u00e5, sweden e-mail: victor.falgas-ravry@math.umu.se#TAB#","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, Mile End Road, London E1 4NS, UK (e-mail:","School of electronic engineering and computer science, queen mary, university of london, mile end road, london e1 4ns, uk e-mail: emil79@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering and Computer Science, Queen Mary, University of London, Mile End Road, London E1 4NS, UK (e-mail:","institution_ids":["https://openalex.org/I166337079"]},{"raw_affiliation_string":"School of electronic engineering and computer science, queen mary, university of london, mile end road, london e1 4ns, uk e-mail: emil79@gmail.com#TAB#","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":6.1234,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.97067849,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"1","first_page":"21","last_page":"54"},"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.9966999888420105,"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.9945999979972839,"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.7759301662445068},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7198435068130493},{"id":"https://openalex.org/keywords/clearance","display_name":"Clearance","score":0.6627227067947388},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6315692067146301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5402131080627441},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5394909977912903},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4111718535423279},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3804995119571686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1780276596546173}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7759301662445068},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7198435068130493},{"id":"https://openalex.org/C138944611","wikidata":"https://www.wikidata.org/wiki/Q1163287","display_name":"Clearance","level":2,"score":0.6627227067947388},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6315692067146301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5402131080627441},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5394909977912903},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4111718535423279},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3804995119571686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1780276596546173},{"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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126894567","wikidata":"https://www.wikidata.org/wiki/Q105650","display_name":"Urology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548312000508","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000508","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W77057346","https://openalex.org/W109926980","https://openalex.org/W1649261915","https://openalex.org/W1981532887","https://openalex.org/W1990307566","https://openalex.org/W1999613943","https://openalex.org/W2003919313","https://openalex.org/W2004751842","https://openalex.org/W2007933101","https://openalex.org/W2019475553","https://openalex.org/W2029849517","https://openalex.org/W2031135370","https://openalex.org/W2034871182","https://openalex.org/W2041862771","https://openalex.org/W2073268088","https://openalex.org/W2074815271","https://openalex.org/W2076011470","https://openalex.org/W2090798615","https://openalex.org/W2099921939","https://openalex.org/W2102457418","https://openalex.org/W2104509227","https://openalex.org/W2111007781","https://openalex.org/W2123553794","https://openalex.org/W2126209209","https://openalex.org/W2126528093","https://openalex.org/W2141747807","https://openalex.org/W2147588640","https://openalex.org/W2152415608","https://openalex.org/W2165707420","https://openalex.org/W2168244850","https://openalex.org/W2169004268","https://openalex.org/W2395767617","https://openalex.org/W2498848698","https://openalex.org/W2952371250","https://openalex.org/W2953118316","https://openalex.org/W4241963438","https://openalex.org/W4248232393"],"related_works":["https://openalex.org/W94007947","https://openalex.org/W4386603341","https://openalex.org/W1972144726","https://openalex.org/W3176776294","https://openalex.org/W2193407120","https://openalex.org/W4250433556","https://openalex.org/W4256429076","https://openalex.org/W2617112367","https://openalex.org/W3165156588","https://openalex.org/W1553466895"],"abstract_inverted_index":{"In":[0,141],"this":[1],"paper,":[2],"we":[3,58,136,154,182,199],"prove":[4,52],"several":[5,103],"new":[6,104],"Tur\u00e1n":[7,54,110],"density":[8,55],"results":[9,56],"for":[10,109,211],"3-graphs":[11,113],"with":[12,41],"independent":[13],"neighbourhoods.":[14],"We":[15,50,101],"show:":[16],"\\begin{align*}":[17,63,91],"\\pi":[18,22,27,64,72,92],"(K_4^-,":[19,23],"C_5,":[20],"F_{3,2})=12/49,":[21],"F_{3,2})=5/18":[24],"\\textrm":[25,66,70],"{and}":[26,71],"(J_4,":[28],"F_{3,2})=\\pi":[29],"(J_5,":[30],"F_{3,2})=3/8,":[31],"\\end{align*}":[32,80,100],"whereJtis":[33],"the":[34,122,146,168,178,188,208,212],"3-graph":[35],"consisting":[36],"of":[37,112,117,131,148,190,207,217],"a":[38,42,142],"single":[39],"vertexxtogether":[40],"disjoint":[43],"setAof":[44],"sizetand":[45],"all":[46],"$\\binom{|A|}{2}$":[47],"3-edges":[48],"containingx.":[49],"also":[51],"two":[53],"where":[57],"forbid":[59],"certain":[60],"induced":[61,68],"subgraphs:":[62],"(F_{3,2},":[65],"{":[67],"}K_4^-)=3/8":[69],"(K_5,":[73],"5\\textrm":[74],"{-set":[75,95],"spanning":[76,96],"exactly":[77,97],"8":[78],"edges})=3/4.":[79],"The":[81],"latter":[82],"result":[83,89],"is":[84,127],"an":[85,129],"analogue":[86],"forK5of":[87],"Razborov's":[88,132,149],"that":[90,171],"(K_4,":[93],"4\\textrm":[94],"1":[98],"edge})=5/9.":[99],"give":[102],"constructions,":[105],"conjectures":[106],"and":[107,193],"bounds":[108],"densities":[111],"which":[114,135,197],"should":[115],"be":[116,174,201,216],"interest":[118],"to":[119,144,157,165,173,203],"researchers":[120],"in":[121,194],"area.":[123],"Our":[124,205],"main":[125],"tool":[126],"\u2018Flagmatic\u2019,":[128],"implementation":[130],"semi-definite":[133,179,213],"method,":[134],"are":[137],"making":[138],"publicly":[139],"available.":[140],"bid":[143],"make":[145,158],"power":[147],"method":[150,214],"more":[151],"widely":[152],"accessible,":[153],"have":[155],"tried":[156],"Flagmatic":[159],"as":[160,162],"user-friendly":[161],"possible,":[163],"hoping":[164],"remove":[166],"thereby":[167],"major":[169],"hurdle":[170],"needs":[172],"cleared":[175],"before":[176],"using":[177],"method.":[180],"Finally,":[181],"spend":[183],"some":[184],"time":[185],"reflecting":[186],"on":[187,196],"limitations":[189],"our":[191],"approach,":[192],"particular":[195],"problems":[198],"may":[200,215],"unable":[202],"solve.":[204],"discussion":[206],"\u2018complexity":[209],"barrier\u2019":[210],"general":[218],"interest.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}
