Skip to main content
SpringerLink
Log in

The maximum number of induced open triangles in graphs of a given order

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

An open triangle is a simple, undirected graph consisting of three vertices and two edges. It is shown that the maximum number of induced open triangles in a graph on n vertices is given by \(\left( \frac{n}{2}-1\right) \lfloor \frac{n}{2}\rfloor \lceil \frac{n}{2}\rceil \). The maximum is achieved for the complete bipartite graph \(K_{\lfloor {n}/{2}\rfloor , \lceil {n}/{2}\rceil }\). The maximum expected number of open triangles in a uniform random graph on n vertices is observed to be asymptotically equivalent.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Batagelj, V., Mrvar, A.: A subquadratic triad census algorithm for large sparse networks with small maximum degree. Soc. Netw. 23, 237–243 (2001)

    Article  Google Scholar 

  2. Erdös, P., Rényi, A.: On random graphs. Publ. Math. 6, 290–297 (1959)

    MathSciNet  MATH  Google Scholar 

  3. Goodman, A.W.: On sets of acquaintances and strangers at any party. Am. Math. Mon. 66, 778–783 (1959)

    Article  MathSciNet  Google Scholar 

  4. Lorden, G.: Blue-empty chromatic graphs. Am. Math. Mon. 69, 114–120 (1962)

    Article  MathSciNet  Google Scholar 

  5. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298, 824–827 (2002)

    Article  Google Scholar 

  6. Moody, J.: Matrix methods for calculating the triad census. Soc. Netw. 20, 291–299 (1998)

    Article  Google Scholar 

  7. Sauve, L.: On chromatic graphs. Am. Math. Mon. 68, 107–111 (1961)

    Article  MathSciNet  Google Scholar 

  8. Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005: Experimental and Efficient Algorithms. Lecture Notes in Computer Science, vol. 3503, pp. 606–609. Springer, Berlin (2005)

    MATH  Google Scholar 

  9. Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, New York (1994)

    Book  Google Scholar 

Download references

Acknowledgements

The authors thank referees for their helpful remarks. The work of the first author was partially supported by the project 17-01-00170 of Russian Foundation for Basic Research and by the program of fundamental scientific researches of the SB RAS I.5.1., Project 0314-2016-0014. Partial support of the second and third authors by NSF Grant CMMI-1538493 is also gratefully acknowledged.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, 4 Koptyug Ave., Novosibirsk, Russia, 630090

    Artem Pyatkin

  2. Novosibirsk State University, 2 Pirogova Str., Novosibirsk, Russia, 630090

    Artem Pyatkin

  3. Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX, 77843, USA

    Eugene Lykhovyd & Sergiy Butenko

Authors
  1. Artem Pyatkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eugene Lykhovyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergiy Butenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergiy Butenko.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pyatkin, A., Lykhovyd, E. & Butenko, S. The maximum number of induced open triangles in graphs of a given order. Optim Lett 13, 1927–1935 (2019). https://doi.org/10.1007/s11590-018-1330-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1330-2

Keywords

Search

Navigation