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

DOI10.1007/S11590-018-1330-2zbMATH Open1432.90134OpenAlexW2897617873WikidataQ129092380 ScholiaQ129092380MaRDI QIDQ2010145FDOQ2010145

Artem Pyatkin, Eugene Lykhovyd, Sergiy Butenko

Publication date: 3 December 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1330-2

Recommendations

• On the maximum number of open triangles in graphs with the same number of vertices and edges
• The maximum number of triangles in a graph of given maximum degree
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Many triangles with few edges
• Triangle-free graphs with the maximum number of cycles

zbMATH Keywords

network analysisinduced 3-pathsinduced open triangles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• On Sets of Acquaintances and Strangers at any Party
• On Chromatic Graphs
• Experimental and Efficient Algorithms
• Blue-Empty Chromatic Graphs

Cited In (5)

• On the maximum number of open triangles in graphs with the same number of vertices and edges
• Polyhedral properties of the induced cluster subgraphs
• The maximum independent union of cliques problem: complexity and exact approaches
• Asymptotic bounds for clustering problems in random graphs
• Measuring associativity: graph algebras of undirected graphs

This page was built for publication: The maximum number of induced open triangles in graphs of a given order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010145)