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

DOI10.1007/s11590-018-1330-2zbMath1432.90134OpenAlexW2897617873WikidataQ129092380 ScholiaQ129092380MaRDI QIDQ2010145

Artem V. Pyatkin, Eugene Lykhovyd, Sergiy I. 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

zbMATH Keywords

network analysisinduced 3-pathsinduced open triangles

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Unnamed Item
• On Sets of Acquaintances and Strangers at any Party
• On Chromatic Graphs
• Blue-Empty Chromatic Graphs
• Experimental and Efficient Algorithms

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