Directed triangles in directed graphs


We show that each directed graph (with no parallel arcs) on n vertices, each with indegree and outdegree at least n=t where t = 2:888997 : : : contains a directed circuit of length at most 3. c © 2003 Elsevier B.V. All rights reserved. 
DOI: 10.1016/j.disc.2003.11.002


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics