{"id":"https://openalex.org/W2011575706","doi":"https://doi.org/10.1017/s0963548308009085","title":"On the Minimal Density of Triangles in Graphs","display_name":"On the Minimal Density of Triangles in Graphs","publication_year":2008,"publication_date":"2008-05-23","ids":{"openalex":"https://openalex.org/W2011575706","doi":"https://doi.org/10.1017/s0963548308009085","mag":"2011575706"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548308009085","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548308009085","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/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["RU","US"],"is_corresponding":true,"raw_author_name":"ALEXANDER A. RAZBOROV","raw_affiliation_strings":["Institute for Advanced Study, Princeton, USA and Steklov Mathematical Institute, Moscow, Russia (e-mail:","Institute for advanced study, princeton, usa and steklov mathematical institute, moscow, russia (e-mail: razborov@ias.edu)#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, USA and Steklov Mathematical Institute, Moscow, Russia (e-mail:","institution_ids":["https://openalex.org/I2801160905","https://openalex.org/I40036882"]},{"raw_affiliation_string":"Institute for advanced study, princeton, usa and steklov mathematical institute, moscow, russia (e-mail: razborov@ias.edu)#TAB#","institution_ids":["https://openalex.org/I2801160905"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008113826"],"corresponding_institution_ids":["https://openalex.org/I2801160905","https://openalex.org/I40036882"],"apc_list":null,"apc_paid":null,"fwci":16.0696,"has_fulltext":false,"cited_by_count":238,"citation_normalized_percentile":{"value":0.9955157,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"17","issue":"4","first_page":"603","last_page":"618"},"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.9994999766349792,"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/T11476","display_name":"Graph theory and applications","score":0.9991000294685364,"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/combinatorics","display_name":"Combinatorics","score":0.7762443423271179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.681456446647644},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6125683784484863},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5853349566459656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5088379979133606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4161511957645416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14905211329460144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.03969454765319824}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7762443423271179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.681456446647644},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6125683784484863},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5853349566459656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5088379979133606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4161511957645416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14905211329460144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.03969454765319824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548308009085","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548308009085","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W229978761","https://openalex.org/W1510730180","https://openalex.org/W1552744309","https://openalex.org/W1607720736","https://openalex.org/W1971212574","https://openalex.org/W2049005199","https://openalex.org/W2078321205","https://openalex.org/W2111754130","https://openalex.org/W2115164934","https://openalex.org/W2115730400","https://openalex.org/W2166750439","https://openalex.org/W2312510043","https://openalex.org/W2323590783","https://openalex.org/W2735975271","https://openalex.org/W4210731599","https://openalex.org/W4242431887","https://openalex.org/W4248232393","https://openalex.org/W7014454993"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2002282073","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W2790190308","https://openalex.org/W1991411408"],"abstract_inverted_index":{"For":[0],"a":[1,20],"fixed":[2],"\u03c1":[3],"\u2208":[4],"[0,":[5],"1],":[6],"what":[7],"is":[8,38],"(asymptotically)":[9],"the":[10,39],"minimal":[11],"possible":[12],"density":[13,24],"g":[14],"3":[15],"(\u03c1)":[16],"of":[17],"triangles":[18],"in":[19],"graph":[21],"with":[22],"edge":[23],"\u03c1?":[25],"We":[26],"completely":[27],"solve":[28],"this":[29],"problem":[30],"by":[31],"proving":[32],"that":[33,42],"where":[34],"$t\\df":[35],"\\lfloor":[36],"1/(1-\\rho)\\rfloor$":[37],"integer":[40],"such":[41],"$\\rho\\in\\bigl[":[43],"1-\\frac":[44],"1t,1-\\frac":[45],"1{t+1}\\bigr]$":[46],".":[47]},"counts_by_year":[{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":36},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":22},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}