✦ LIBER ✦

Directed triangles in directed graphs

✍ Scribed by M. de Graaf; A. Schrijver; P.D. Seymour

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 212 KB
Volume: 110
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90719-v

No coin nor oath required. For personal study only.

✦ Synopsis

de Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs, Discrete Mathematics 110 (1992) 279-282.

h on n vertices, each with indegree and outdegree at least n/t, contains a directed circuit of length at most

📜 SIMILAR VOLUMES

Directed Triangles in Digraphs

✍ Jian Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let c be the smallest possible value such that every digraph on n vertices with minimum outdegree at least cn contains a directed triangle. It was conjectured by Caccetta and Ha ggkvist in 1978 that c=1Â3. Recently Bondy showed that c (2 -6&3)Â5=0.3797... by using some counting arguments. In this no

Directed hamiltonian graphs

✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.

Orthogonal Structures in Directed Graphs

✍ S. Felsner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Using the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality between chain and antichain families András Frank could give common access (and proof) to some famous results in the theory of finite posets:

On antimagic directed graphs

✍ Dan Hefetz; Torsten Mütze; Justus Schwartz 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract An antimagic labeling of an undirected graph __G__ with __n__ vertices and __m__ edges is a bijection from the set of edges of __G__ to the integers {1, …, __m__} such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with th

On persistent directed graphs

✍ Jorgen Bang-Jensen; Tibor Jordán 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views