Abstract
Caccetta-Häggkvist’s Conjecture discusses the relation between the girth g(D) of a digraph D and the minimum outdegree δ + (D) of D. The special case when g(D) = 3 has lately attracted wide attention. For an undirected graph G, the binding number \(bind(G)\geq \frac 3 2\) is a sufficient condition for G to have a triangle (cycle with length 3). In this paper we generalize the concept of binding numbers to digraphs and give some corresponding results. In particular, the value range of binding numbers is given, and the existence of digraphs with a given binding number is confirmed. By using the binding number of a digraph we give a condition that guarantees the existence of a directed triangle in the digraph. The relationship between binding number and connectivity is also discussed.
Supported by NSFC grant No. 10101021.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Behzad, M., Chartrand, G., Wall, C.: On Minimal Regular Digraphs with Given Girth. Fund. Math. 69, 227–231 (1970)
Behzad, M.: Minimally 2-Regular Digraphs with Given Girth. J. Math. Soc. Japan 25, 1–6 (1973)
Bermond, J.C.: 1-Graphs Réguliers de Girth Donné. Cahiers Centre Etudes Rech. Oper. Bruxelles 17, 123–135 (1975)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan London, Elsevier New York (1976)
Bondy, J.A.: Counting Subgraphs: A New Approach to the Caccetta-Häggkvist Conjecture. Discrete Math. 165, 166, 71–80 (1997)
Broerssma, H.J., Li, X.: Some Approaches to a Conjecture on Short Cycles in Digraphs. Discrete Appl. Math. 120, 45–53 (2002)
Caccetta, L., Häggkvist, R.: On Minimal Digraphs with Given Girth. Congr. Numer. 21, 181–187 (1978)
Chvátal, V., Szemerédi, E.: Short Cycles in Directed Graphs. J. Combin. Theory Ser. B 35, 323–327 (1983)
Goodman, A.W.: Triangles in a Complete Chromatic Graph with Three Colors. Discrete Math. 5, 225–235 (1985)
de Graaf, M., Schrijver, A.: Directed Triangles in Directed Graphs. Discrete Math. 110, 279–282 (1992)
Hamidoune, Y.O.: A Note on Minimal Directed Graphs with Given Girth. J. Combin. Theory Ser. B 43, 343–348 (1987)
Hoàng, C.T., Reed, B.: A Note on Short Cycle in Digraphs. Discrete Math. 66, 103–107 (1987)
Li, Q., Brualdi, R.A.: On Minimal Directed Graphs with Girth 4. J. Czechoslovak Math. 33, 439–447 (1983)
Nishimura, T.: Short Cycles in Digraphs. Discrete Math. 72, 295–298 (1988)
Shen, J.: Directed Triangles in Digraphs. J. Combin. Theory Ser. B 73, 405–407 (1998)
Shen, J.: On the Girth of Digraphs. Discrete Math. 211, 167–181 (2000)
Shen, J.: On the Caccetta-Häggkvist Conjecture. Graphs and Combinatorics 18, 645–654 (2002)
Shi, R.: The Binding Number of a Graph and its Triangle. Acta Mathematicae Applicatae Sinica 2(1), 79–86 (1985)
Woodall, D.R.: The Binding Number of a Graph and its Anderson Number. J. Combin. Theory Ser. B. 15, 225–255 (1973)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Xu, G., Li, X., Zhang, S. (2007). The Binding Number of a Digraph. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)