On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament

zbMath1361.05059MaRDI QIDQ528999

Andrzej Grzesik

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p19

zbMATH Keywords

directed graphtransitive tournamentdirected triangleminimum outdegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (2)

Minimum number of edges that occur in odd cycles ⋮ Properly colored short cycles in edge-colored graphs

Uses Software

• Flagmatic
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• A note on short cycles in digraphs
• On the maximum number of five-cycles in a triangle-free graph
• Short cycles in directed graphs
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On directed triangles in digraphs
• A note on minimal directed graphs with given girth
• Short cycles in digraphs
• Directed triangles in digraphs
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• On the Caccetta-Häggkvist conjecture
• On the number of pentagons in triangle-free graphs
• On the girth of digraphs
• Minimum number of edges that occur in odd cycles
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• Hypergraphs Do Jump
• On the Minimal Density of Triangles in Graphs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Counting flags in triangle-free digraphs

This page was built for publication: On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament