{"id":"https://openalex.org/W1981345652","doi":"https://doi.org/10.1017/s0963548304006601","title":"Triangle Density and Contractibility","display_name":"Triangle Density and Contractibility","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1981345652","doi":"https://doi.org/10.1017/s0963548304006601","mag":"1981345652"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548304006601","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006601","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/57F812FF266C48637F49F2E947C419F2/S0963548304006601a.pdf/div-class-title-triangle-density-and-contractibility-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":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/57F812FF266C48637F49F2E947C419F2/S0963548304006601a.pdf/div-class-title-triangle-density-and-contractibility-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037836325","display_name":"Matthias Kriesell","orcid":"https://orcid.org/0000-0002-7302-7496"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"MATTHIAS KRIESELL","raw_affiliation_strings":["Instititut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany (e-mail:","Instititut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany (e-mail: kriesell@math.uni-hannover.de)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Instititut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany (e-mail:","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Instititut f\u00fcr Mathematik (A), Universit\u00e4t Hannover, Welfengarten 1, D-30167 Hannover, Germany (e-mail: kriesell@math.uni-hannover.de)#TAB#","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037836325"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":null,"apc_paid":null,"fwci":1.2735,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79888268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"1-2","first_page":"133","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/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/T11476","display_name":"Graph theory and applications","score":0.9994000196456909,"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.8405011296272278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.757978618144989},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7039145231246948},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6157938838005066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.357088565826416}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8405011296272278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.757978618144989},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7039145231246948},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6157938838005066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.357088565826416}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548304006601","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006601","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/57F812FF266C48637F49F2E947C419F2/S0963548304006601a.pdf/div-class-title-triangle-density-and-contractibility-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:www.repo.uni-hannover.de:123456789/2735","is_oa":true,"landing_page_url":"http://www.repo.uni-hannover.de/handle/123456789/2735","pdf_url":null,"source":{"id":"https://openalex.org/S4306401575","display_name":"Institutional Repository of Leibniz Universit\u00e4t Hannover (Leibniz Universit\u00e4t Hannover)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114112103","host_organization_name":"Leibniz University Hannover","host_organization_lineage":["https://openalex.org/I114112103"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics, Probability and Computing 14 (2005), Nr. 1-2","raw_type":"doc-type:Article"},{"id":"doi:10.15488/2709","is_oa":true,"landing_page_url":"https://doi.org/10.15488/2709","pdf_url":null,"source":{"id":"https://openalex.org/S7407052956","display_name":"Leibniz Universit\u00e4t Hannover","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1017/s0963548304006601","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006601","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/57F812FF266C48637F49F2E947C419F2/S0963548304006601a.pdf/div-class-title-triangle-density-and-contractibility-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/W1981345652.pdf","grobid_xml":"https://content.openalex.org/works/W1981345652.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1516768651","https://openalex.org/W1984083720","https://openalex.org/W2053580831","https://openalex.org/W2065330288","https://openalex.org/W2798588639","https://openalex.org/W4233716566","https://openalex.org/W4253988918","https://openalex.org/W4300303686"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2099195351","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Let":[0],"$G$":[1,18,32,108],"be":[2],"a":[3,73,88,93],"noncomplete":[4],"$k$":[5,21,74,94,105],"-connected":[6,75,95,106],"graph":[7,76,107],"such":[8,115],"that":[9,116],"the":[10,27],"graphs":[11],"obtained":[12],"from":[13],"contracting":[14],"any":[15],"edge":[16,84],"in":[17,31,61,87],"are":[19,120],"not":[20,85],"-connected,":[22],"and":[23,118],"let":[24],"$t(G)$":[25],"denote":[26],"number":[28],"of":[29],"triangles":[30,80],".":[33,50],"Thomassen":[34],"proved":[35,66],"$t(G)":[36,47,54],"\\geq":[37,48,55,70,102],"1$":[38],",":[39,72],"which":[40],"was":[41],"later":[42],"improved":[43],"by":[44],"Mader":[45],"to":[46],"\\frac{1}{3}|V(G)|$":[49],"Here":[51],"we":[52],"show":[53],"\\frac{2}{3}|V(G)|$":[56],"(which":[57],"is":[58,65],"best":[59],"possible":[60],"general).":[62],"Furthermore":[63],"it":[64],"that,":[67],"for":[68,100],"$k":[69,101],"4$":[71,103],"without":[77],"two":[78,110],"disjoint":[79,111],"must":[81],"contain":[82],"an":[83,98],"contained":[86],"triangle":[89],"whose":[90],"contraction":[91],"yields":[92],"graph.":[96],"As":[97],"application,":[99],"every":[104],"admits":[109],"induced":[112],"cycles":[113],"$C_1,C_2$":[114],"$G-V(C_1)$":[117],"$G-V(C_2)$":[119],"$(k-3)$":[121],"-connected.":[122]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}