Independent Directed Triangles in a Directed Graph | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Independent Directed Triangles in a Directed Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

If D is a directed graph of order n≥3 with , then D contains independent directed triangles. Moreover, the condition on the minimum degree is sharp in general.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Idaho, Moscow, IH 83844, USA, , , , , , US

    Hong WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932

Authors
  1. Hong WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: April 19, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932, H. Independent Directed Triangles in a Directed Graph. Graphs Comb 16, 453–462 (2000). https://doi.org/10.1007/PL00007230

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007230

Search

Navigation