On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

DOI10.1002/JGT.21707zbMath1273.05115arXiv1107.2247OpenAlexW2102204848WikidataQ123285630 ScholiaQ123285630MaRDI QIDQ2853341

Alexander A. Razborov

Publication date: 21 October 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2247

zbMATH Keywords

oriented graphoutdegree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• A note on short cycles in digraphs
• Short cycles in directed graphs
• Limits of dense graph sequences
• 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 girth of digraphs
• On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Flag algebras
• On minimal regular digraphs with given girth
• Counting flags in triangle-free digraphs

Related Items (15)

Rainbow triangles in three-colored graphs ⋮ Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ Short rainbow cycles in graphs and matroids ⋮ Rainbow cycles for families of matchings ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ Sparse halves in dense triangle-free graphs ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Counting flags in triangle-free digraphs ⋮ Degree conditions forcing oriented cycles ⋮ Minimum number of edges that occur in odd cycles ⋮ Properly colored short cycles in edge-colored graphs ⋮ On the Density of Transitive Tournaments

This page was built for publication: On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs