triangle-free graph
undirected graph in which no three vertices form a triangle of edges
Facts
6 properties- Instance of
- class of the graphs without certain subgraphs
- Subclass of
- diamond-free graph, paw-free graph, co-claw-free graph[3][4][5]
- Does not have part
- triangle graph[8]
- Has characteristic
- clique number[6]
- Studied by
- graph theory[7]
🏷️ Also known as
en K₃-free graph
en C₃-free graph
en triangle-free graph
ar بيان خال من المثلث
ar بيان خالٍ من المثلث
cs graf bez trojúhelníků
de dreiecksfreier Graph
es Grafos sin triangulos
fa گراف آزاد-مثلث
fr graphe sans triangle
he גרף ללא משולש
he גרף נטול משולשים
hu háromszögmentes gráf
ja トライアングルフリーグラフ
pt grafos sem triangulos
ru граф без треугольников
uk граф без трикутників
zh 無三角形圖
🔖 Identifiers · 7
- OpenAlex ID
- C114727528
- Image (Wikimedia Commons)
- Biclique K 5 5.svg ↗
- Freebase ID
- /m/0268c5j
- Graphclasses.org ID
- gc_371
- MathWorld ID
- Triangle-FreeGraph
- Microsoft Academic ID (discontinued)
- 114727528
- Wolfram Language entity code
- Entity["GraphClass", "TriangleFree"]
🔗 Connections
Examples 19
Does not have part 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Subtypes 1
← Statement describes 1
Press Enter · cited answer in seconds
0 sources
Summary
triangle-free graph is a class of the graphs without certain subgraphs[1].