Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
type: Item
instance of: scholarly article
title: Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
zbMATH Open document ID: 0872.05016
DOI: 10.1016/S0012-365X(96)00162-8
author: J. A. Bondy
published in: Discrete Mathematics
publication date: 1997-10-07T00:00:00Z
review text: L. Caccetta and R. Häggkvist conjectured that in a digraph \(D\) on \(n\) vertices, the girth of \(D\) is at most \(\lfloor n/d\rfloor\), if each vertex is of out-degree at least \(d\). The paper discusses the case where \(d=\lceil n/3\rceil\).
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 1019086
zbMATH Keywords: digraph
zbMATH Keywords: girth
Wikidata QID: Q123135083
reviewed by: Wai-Kai Chen
MaRDI profile type: Publication
cites work: On minimal regular digraphs with given girth
cites work: Q3852212
cites work: Q3921262
cites work: Q4192089
cites work: Short cycles in directed graphs
cites work: Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
cites work: Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
cites work: On Sets of Acquaintances and Strangers at any Party
cites work: Triangles in a complete chromatic graph with three colors
cites work: Directed triangles in directed graphs
cites work: A note on minimal directed graphs with given girth
cites work: A note on short cycles in digraphs
cites work: Q3329497
cites work: Q4106232
cites work: Q3669452
cites work: Short cycles in digraphs
cites work: Q5781249
cites work: Cages—a survey
description: scientific article; zbMATH DE number 1019086