Last Updated：2025/11/30

(graph theory) Of an undirected graph in which no three vertices form a triangle of edges.

音声機能が動作しない場合はこちらをご確認ください

See correct answer

triangle-free

Source Word

triangle-free

not-comparable

(graph theory) Of an undirected graph in which no three vertices form a triangle of edges.

Japanese Meaning

無向グラフにおいて、任意の3頂点が三角形（閉路）を形成しないグラフ、すなわち三角形を持たないグラフ

The combinatorics seminar focused on recent techniques to estimate the maximum number of edges in a triangle-free graph.

組合せ論のセミナーでは、どの3つの頂点も辺で三角形を形成しない無向グラフの辺の最大数を推定する最近の手法に焦点が当てられた。

Sense（1）

(graph theory) Of an undirected graph in which no three vertices form a triangle of edges.