{"id":"https://openalex.org/W2020243626","doi":"https://doi.org/10.1017/s0963548312000235","title":"Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing","display_name":"Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing","publication_year":2012,"publication_date":"2012-09-27","ids":{"openalex":"https://openalex.org/W2020243626","doi":"https://doi.org/10.1017/s0963548312000235","mag":"2020243626"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000235","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000235","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/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"RAPHAEL YUSTER","raw_affiliation_strings":["Department of Mathematics, University of Haifa, Haifa 31905, Israel (e-mail:","Department of mathematics, university of haifa, haifa 31905, israel (e-mail: raphy@math.haifa.ac.il)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa 31905, Israel (e-mail:","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"Department of mathematics, university of haifa, haifa 31905, israel (e-mail: raphy@math.haifa.ac.il)#TAB#","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026016357"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":3.2989,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91771228,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"6","first_page":"952","last_page":"962"},"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.9983999729156494,"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.9983999729156494,"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.9979000091552734,"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.9945999979972839,"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.8482089638710022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7244320511817932},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6751547455787659},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5814021825790405},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5794146060943604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4802706241607666},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38594475388526917}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8482089638710022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7244320511817932},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6751547455787659},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5814021825790405},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5794146060943604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4802706241607666},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38594475388526917},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548312000235","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000235","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":7,"referenced_works":["https://openalex.org/W1969037852","https://openalex.org/W1990953773","https://openalex.org/W2007508589","https://openalex.org/W2058108962","https://openalex.org/W2119414881","https://openalex.org/W2951773826","https://openalex.org/W4246647751"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W1971174658","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2562400057","https://openalex.org/W2020053772","https://openalex.org/W2035433397","https://openalex.org/W1553466895"],"abstract_inverted_index":{"It":[0],"is":[1,43,91,100],"well":[2],"known":[3],"that":[4,41,59,62,128],"a":[5,69,107],"graph":[6,96],"with":[7],"m":[8,19,48,82,109,139],"edges":[9,50],"can":[10],"be":[11],"made":[12],"triangle-free":[13,67],"by":[14],"removing":[15],"(slightly":[16],"less":[17],"than)":[18],"/2":[20,49],"edges.":[21],"On":[22],"the":[23,39,92,95,117],"other":[24],"hand,":[25],"there":[26],"are":[27,33,63],"many":[28],"classes":[29],"of":[30,72,94,120,137],"graphs":[31,61,130],"which":[32,114],"hard":[34,64],"to":[35,45,53,65,149],"make":[36,66],"triangle-free,":[37],"in":[38,51],"sense":[40],"it":[42],"necessary":[44],"remove":[46],"roughly":[47],"order":[52],"eliminate":[54],"all":[55],"triangles.":[56,75],"We":[57,126,143],"prove":[58],"dense":[60,124],"have":[68,79,131],"large":[70],"packing":[71,136],"pairwise":[73,86],"edge-disjoint":[74,87],"In":[76],"particular,":[77],"they":[78],"more":[80],"than":[81],"(1/4+":[83],"c":[84,98],"\u03b2)":[85],"triangles":[88,148],"where":[89],"\u03b2":[90],"density":[93],"and":[97,152],"\u2265":[99],"an":[101,132],"absolute":[102],"constant.":[103],"This":[104],"improves":[105],"upon":[106],"previous":[108],"(1/4\u2212":[110],"o":[111,141],"(1))":[112],"bound":[113],"follows":[115],"from":[116,147],"asymptotic":[118],"validity":[119],"Tuza's":[121],"conjecture":[122,127],"for":[123],"graphs.":[125],"such":[129],"asymptotically":[133],"optimal":[134],"triangle":[135],"size":[138],"(1/3\u2212":[140],"(1)).":[142],"extend":[144],"our":[145],"result":[146],"larger":[150],"cliques":[151],"odd":[153],"cycles.":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}