176 search results - page 1 / 36 » On Directed Triangles in Digraphs |
COMBINATORICS
2007
13 years 7 months ago
2007
Using a recent result of Chudnovsky, Seymour, and Sullivan, we slightly improve two bounds related to the Caccetta-Haggkvist Conjecture. Namely, we show that if α ≥ 0.35312, th...
SIAMDM
2008
13 years 7 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
JGT
2007
13 years 7 months ago
2007
It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a la...
JCT
1998
13 years 7 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
EJC
2010
13 years 7 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass