The Caccetta-häggkvist Conjecture and Additive Number Theory

نویسنده

  • MELVYN B. NATHANSON
چکیده

The Caccetta-Häggkvist conjecture states that if G is a finite directed graph with at least n/k edges going out of each vertex, then G contains a directed cycle of length at most k. Hamidoune used methods and results from additive number theory to prove the conjecture for Cayley graphs and for vertex-transitive graphs. This expository paper contains a survey of results on the Caccetta-Häggkvist conjecture, and complete proofs of the conjecture in the case of Cayley and vertex-transitive graphs. 1. Many edges imply short cycles A finite directed graph G = (V,E) consists of a finite set V = V (G) of vertices and a finite set E = E(G) of edges, where an edge e = (v, v) is an ordered pair of vertices. If e = (v, v) is an edge, then the vertex v is called the tail of e, and v is called the head of e. The outdegree of a vertex v ∈ V , denoted outdegG(v), is the number of edges e ∈ E of the form (v, v), that is the number of edges with tail v. The indegree of a vertex v ∈ V , denoted indegG(v′), is the number of edges e ∈ E of the form (v, v), that is the number of edges with head v. Let v and v be distinct vertices of the finite directed graph G. A directed path of length l in G from vertex v to vertex v is a sequence of l edges (v0, v1), (v1, v2), . . . , (vl−1, vl) such that v = v0 and v ′ = vl. A directed cycle of length l in G is a sequence of l edges (v0, v1), (v1, v2), . . . , (vl−1, vl) such that v0 = vl. A loop is a cycle of length 1, that is, an edge of the form (v, v). A cycle of length 2 is called a digon, and consists of two edges of the form (v0, v1) and (v1, v0), where v0 6= v1. A directed triangle is a cycle of length 3 of the form (v0, v1), (v1, v2), (v2, v0), where the vertices v0, v1, v2 are distinct. It is reasonable to expect that a finite directed graph with many edges should have many cycles, and, in particular, should have short cycles. A quantitative expression of this intuition is the following: 2000 Mathematics Subject Classification. 05C20,05C25,11B13,11P99.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Summary of Results and Problems Related to the Caccetta-Häggkvist Conjecture

This paper is an attempt to survey the current state of our knowledge on the Caccetta-Haggkvist conjecture and related questions. In January 2006 there was a workshop hosted by the American Institute of Mathematics in Palo Alto, on the Caccetta-Haggkvist conjecture, and this paper partly originated there, as a summary of the open problems and partial results presented at the workshop. Our thank...

متن کامل

Total domination and the Caccetta-Häggkvist conjecture

A total dominating set in a digraph G is a subset W of its vertices such that every vertex of G has an immediate successor in W . The total domination number of G is the size of the smallest total dominating set. We consider several lower bounds on the total domination number and conjecture that these bounds are strictly larger than g(G) − 1, where g(G) is the number of vertices of the smallest...

متن کامل

On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs

The Caccetta-Häggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length ≤ l must contain a vertex of outdegree at most n−1 l . It has a rather elaborate set of (conjectured) extremal configurations. In this paper we consider the case l = 3 that received quite a significant attention in the literature. We identify three orgraphs on four vertices ...

متن کامل

On the girth of digraphs

It was conjectured by Caccetta and H aggkvist in 1978 that the girth of every digraph with n vertices and minimum outdegree r is at most dn=re. The conjecture was proved for r = 2 by Caccetta and H aggkvist, for r = 3 by Hamidoune and for r = 4; 5 by Ho ang and Reed. In this paper, the following two main results are proved: 1. The diameter of every strongly connected digraph of order n with g...

متن کامل

On the Caccetta-Häggkvist Conjecture with a Forbidden Transitive Tournament

The Caccetta-Häggkvist Conjecture asserts that every oriented graph on n vertices without directed cycles of length less than or equal to l has minimum outdegree at most (n−1)/l. In this paper we state a conjecture for graphs missing a transitive tournament on 2 + 1 vertices, with a weaker assumption on minimum outdegree. We prove that the Caccetta-Häggkvist Conjecture follows from the presente...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008