Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture

DOI10.1016/S0012-365X(96)00162-8zbMath0872.05016WikidataQ123135083 ScholiaQ123135083MaRDI QIDQ1356730

J. A. Bondy

Publication date: 7 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphgirth

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Some approaches to a conjecture on short cycles in digraphs ⋮ Directed triangles in digraphs ⋮ Short rainbow cycles in graphs and matroids ⋮ Rainbow cycles for families of matchings ⋮ On Sullivan's conjecture on cycles in 4-free and 5-free digraphs ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Counting flags in triangle-free digraphs ⋮ Directed triangles in directed graphs ⋮ A new bound for a particular case of the Caccetta-Häggkvist conjecture ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

Cites Work

• A note on short cycles in digraphs
• Short cycles in directed graphs
• Triangles in a complete chromatic graph with three colors
• A note on minimal directed graphs with given girth
• Short cycles in digraphs
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
• On Sets of Acquaintances and Strangers at any Party
• Cages—a survey
• On minimal regular digraphs with given girth
• Directed triangles in directed graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture