Geodesic
On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges
Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 46-55

Voir la notice de l'article provenant de la source Math-Net.Ru

An open triangle (OT) is a $3$-vertex subgraph with two edges, i. e. an induced path of length $2$. A formula for the maximum number of OT in $n$-vertex graphs with $n$ edges is proved in the paper. We also present a full characterization of graphs for which the maximum is attained. Illustr. 2, bibliogr. 10.
Keywords: open triangles, induced subgraphs, unicyclic graphs. 
@article{DA_2022_29_1_a3,
     author = {A. V. Pyatkin and O. I. Chernykh},
     title = {On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {46--55},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2022},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2022_29_1_a3/}
}
TY  - JOUR
AU  - A. V. Pyatkin
AU  - O. I. Chernykh
TI  - On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2022
SP  - 46
EP  - 55
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2022_29_1_a3/
LA  - ru
ID  - DA_2022_29_1_a3
ER  - 
%0 Journal Article
%A A. V. Pyatkin
%A O. I. Chernykh
%T On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges
%J Diskretnyj analiz i issledovanie operacij
%D 2022
%P 46-55
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2022_29_1_a3/
%G ru
%F DA_2022_29_1_a3
A. V. Pyatkin; O. I. Chernykh. On the maximum number of open triangles in~graphs with the same number of~vertices~and~edges. Diskretnyj analiz i issledovanie operacij, Tome 29 (2022) no. 1, pp. 46-55. http://geodesic.mathdoc.fr/item/DA_2022_29_1_a3/