{"id":"https://openalex.org/W2950318982","doi":"https://doi.org/10.37236/1020","title":"On Directed Triangles in Digraphs","display_name":"On Directed Triangles in Digraphs","publication_year":2007,"publication_date":"2007-09-07","ids":{"openalex":"https://openalex.org/W2950318982","doi":"https://doi.org/10.37236/1020","mag":"2950318982"},"language":"en","primary_location":{"id":"doi:10.37236/1020","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1020","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n19/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/v14i1n19/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013082644","display_name":"Peter Hamburger","orcid":null},"institutions":[{"id":"https://openalex.org/I162817326","display_name":"Indiana University \u2013 Purdue University Fort Wayne","ror":"https://ror.org/01jxzq227","country_code":"US","type":"education","lineage":["https://openalex.org/I162817326"]},{"id":"https://openalex.org/I94339441","display_name":"Western Kentucky University","ror":"https://ror.org/0446vnd56","country_code":"US","type":"education","lineage":["https://openalex.org/I94339441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Hamburger","raw_affiliation_strings":["Department of Mathematical Sciences, Indiana University -Purdue University Fort Wayne, Fort Wayne, IN 46805 and Department of Mathematics,","Western Kentucky University, Bowling Green, KY 42101-1078"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Indiana University -Purdue University Fort Wayne, Fort Wayne, IN 46805 and Department of Mathematics,","institution_ids":["https://openalex.org/I162817326"]},{"raw_affiliation_string":"Western Kentucky University, Bowling Green, KY 42101-1078","institution_ids":["https://openalex.org/I94339441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073055503","display_name":"Penny Haxell","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Penny Haxell","raw_affiliation_strings":["Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080894223","display_name":"Alexandr Kostochka","orcid":"https://orcid.org/0000-0002-6363-3804"},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexandr Kostochka","raw_affiliation_strings":["Department of Mathematics, University of Illinois, Urbana, IL 61801 and Institute of Mathematics, Novosibirsk 630090, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana, IL 61801 and Institute of Mathematics, Novosibirsk 630090, Russia","institution_ids":["https://openalex.org/I183874917"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0297,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.95807896,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"1","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.9998000264167786,"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.9998000264167786,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9075781106948853},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.9054545760154724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8027147650718689},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7129001617431641},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7120693325996399},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5121140480041504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3581323027610779},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2574300467967987}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9075781106948853},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9054545760154724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8027147650718689},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7129001617431641},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7120693325996399},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5121140480041504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3581323027610779},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2574300467967987}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/1020","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1020","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n19/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"}],"best_oa_location":{"id":"doi:10.37236/1020","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1020","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v14i1n19/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/G3839864768","display_name":null,"funder_award_id":"DMS-0650784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4827906941","display_name":"Extremal problems on packing sparse graphs and hypergraphs","funder_award_id":"0400498","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7935037666","display_name":"Collaborative research on degree conditions for packing and covering problems on  graphs","funder_award_id":"0650784","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307521","display_name":"American Institute of Mathematics","ror":"https://ror.org/02a0fwv66"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2950318982.pdf","grobid_xml":"https://content.openalex.org/works/W2950318982.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1987195239","https://openalex.org/W2071879962","https://openalex.org/W2129187039","https://openalex.org/W2770196964","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3082102970","https://openalex.org/W2962928708","https://openalex.org/W2350235717","https://openalex.org/W755952011","https://openalex.org/W1973041905","https://openalex.org/W2950318982","https://openalex.org/W3083664609","https://openalex.org/W4316126606","https://openalex.org/W4286984550","https://openalex.org/W3161232744"],"abstract_inverted_index":{"Using":[0],"a":[1,39,66],"recent":[2],"result":[3],"of":[4,57],"Chudnovsky,":[5],"Seymour,":[6],"and":[7,54],"Sullivan,":[8],"we":[9,20],"slightly":[10],"improve":[11],"two":[12],"bounds":[13],"related":[14],"to":[15],"the":[16,52,55],"Caccetta-Haggkvist":[17],"Conjecture.":[18],"Namely,":[19],"show":[21],"that":[22],"if":[23],"$\\alpha\\geq":[24],"0.35312$,":[25],"then":[26,45],"each":[27,58],"$n$-vertex":[28,47],"digraph":[29,48],"$D$":[30,49],"with":[31],"minimum":[32],"outdegree":[33,53],"at":[34,61],"least":[35,62],"$\\alpha":[36],"n$":[37,64],"has":[38,65],"directed":[40,67],"$3$-cycle.":[41,68],"If":[42],"$\\beta\\geq":[43],"0.34564$,":[44],"every":[46],"in":[50],"which":[51],"indegree":[56],"vertex":[59],"is":[60],"$\\beta":[63]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}