Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4, graphs with no induced 3-cycle, or locally independent graphs. By Turán's theorem, the n-vertex triangle-free graph with the maximum number of edges is a complete bipartite graph in which the numbers of vertices on each side of the bipartition are as equal as possible.
Wikipage redirect
Aanderaa–Karp–Rosenberg conjectureAndrew M. GleasonAndrásfai graphApex graphArrangement of linesBidiakis cubeBrinkmann graphBrooks' theoremBull graphButterfly graphCaterpillar treeChordal bipartite graphChvátal graphCircle graphClaw-free graphClebsch graphClique (graph theory)Clique coverClique problemCombinatoricsComplement graphComplete bipartite graphCycle (graph theory)Cycle double coverDiamond graphDistance-hereditary graphEdge coloringFolded cube graphForbidden graph characterizationFour color theoremFranklin graphFriendship graphGewirtz graphGirth (graph theory)Glossary of graph theoryGraph coloringGraph propertyGrötzsch's theoremGrötzsch graphHajós construction
Link from a Wikipage to another Wikipage
primaryTopic
Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4, graphs with no induced 3-cycle, or locally independent graphs. By Turán's theorem, the n-vertex triangle-free graph with the maximum number of edges is a complete bipartite graph in which the numbers of vertices on each side of the bipartition are as equal as possible.
has abstract
En Teoría de grafos, un grafo ...... ón sea lo más similar posible.
@es
En théorie des graphes, un gra ...... d'arêtes formant un triangle.
@fr
In the mathematical area of gr ...... tion are as equal as possible.
@en
Na área de Teoria dos grafos d ...... é o mais semelhante possível.
@pt
В теории графов графом без тре ...... ков, должно быть меньше рёбер.
@ru
У теорії графів графом без три ...... настільки, наскільки можливо.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,352,762
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
En Teoría de grafos, un grafo ...... ón sea lo más similar posible.
@es
En théorie des graphes, un gra ...... d'arêtes formant un triangle.
@fr
In the mathematical area of gr ...... tion are as equal as possible.
@en
Na área de Teoria dos grafos d ...... é o mais semelhante possível.
@pt
В теории графов графом без тре ...... ков, должно быть меньше рёбер.
@ru
У теорії графів графом без три ...... настільки, наскільки можливо.
@uk
label
Grafos sem triangulos
@pt
Grafos sin triángulos
@es
Graphe sans triangle
@fr
Triangle-free graph
@en
Граф без треугольников
@ru
Граф без трикутників
@uk