The Turán graph, denoted by T ( n , r ) {\displaystyle T(n,r)} , is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle...

Turán 1977, p. 7. P. Turán, «A note of welcome», Journal of Graph Theory 1 (1977), pp. 7-9. Turán 1977, p. 8. "Mathematical Graffiti #1 – Pál Turán e...

n-vertex graphs. Turán's theorem, and the Turán graphs giving its extreme case, were first described and studied by Hungarian mathematician Pál Turán in 1941...

regular graph Threshold graph Total graph Tree (graph theory). Trellis (graph) Turán graph Ultrahomogeneous graph Vertex-transitive graph Visibility graph Museum...

extremal number. Turán's theorem says that ex(n; Kr) = tr − 1(n), the number of edges of the Turán graph T(n, r − 1), and that the Turán graph is the unique...

k-partite graphs and graphs that avoid larger cliques as subgraphs in Turán's theorem, and these two complete bipartite graphs are examples of Turán graphs, the...

K_{r})} and characterizes all graphs attaining this maximum; such graphs are known as Turán graphs. For non-bipartite graphs G {\displaystyle G} , the Erdős–Stone...

A graph with 0 vertices is also called null graph. Turán 1.  Pál Turán 2.  A Turán graph is a balanced complete multipartite graph. 3.  Turán's theorem...

The graphs meeting this bound are the Moon–Moser graphs K3,3,..., a special case of the Turán graphs arising as the extremal cases in Turán's theorem...

generally any Turán graph is locally Turán. Every planar graph is locally outerplanar. However, not every locally outerplanar graph is planar. A graph is triangle-free...

multipartite graph is a graph that is complete k-partite for some k. The Turán graphs are the special case of complete multipartite graphs in which each...

Ramsey-Turán theory is a subfield of extremal graph theory. It studies common generalizations of Ramsey's theorem and Turán's theorem. In brief, Ramsey-Turán...

Forces Turanism, a political movement Curse of Turan, a Hungarian superstition Turán graph, a mathematical graph Tourane, former name of Đà Nẵng, a port city...

In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation...

the edge graphs of the corresponding demihypercube. The Turán graph T ( 2 n , n ) {\displaystyle T(2n,n)} (also known as "cocktail party graph" ) is the...

hypercube. The vertex-edge graph of an n-dimensional cross-polytope is the Turán graph T(2n, n) (also known as a cocktail party graph ). In 1 dimension the...

drawing. The study of crossing numbers originated in Turán's brick factory problem, in which Pál Turán asked for a factory plan that minimized the number...

cliques, then X {\displaystyle X} is said to be a class of graphs with few cliques. The Turán graph T ( n , ⌈ n / 3 ⌉ ) {\displaystyle T(n,\lceil n/3\rceil...

opposite vertices. More generally, it is a Turán graph T 6 , 3 {\displaystyle T_{6,3}} . The octahedral graph is 4-connected, meaning that it takes the...

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...

Kővári–Sós–Turán theorem provides an upper bound on the solution to the Zarankiewicz problem. It was established by Tamás Kővári, Vera T. Sós and Pál Turán shortly...

sets have the same size, cluster graphs are well-covered. The Turán graphs are complement graphs of cluster graphs, with all complete subgraphs of equal...

unions of isomorphic complete graphs, the Turán graphs formed as the complement graphs of mKn, the 3 × 3 rook's graph, and the 5-cycle. The only countably...

specially the results obtained by Turán in 1941 was at the origin of another branch of graph theory, extremal graph theory. The four color problem remained...

n/k+1\rfloor ^{n{\bmod {k}}}.} The graphs achieving this bound are again Turán graphs. Certain families of graphs may, however, have much more restrictive...

for r = 2 by Turán (1941), and the problem for general r was introduced in Turán (1961). The paper (Sidorenko 1995) gives a survey of Turán numbers. Fix...

geometric graph. Ever since Pál Turán coined his brick factory problem during World War II, the determination or estimation of crossing numbers of graphs has...

equitable coloring is that it is an embedding of the given graph as a subgraph of a Turán graph with the same set of vertices. There are two kinds of chromatic...

of study in graph drawing and as an important tool in VLSI design and discrete geometry. Both Zarankiewicz and Kazimierz Urbanik saw Turán speak about...

disjoint union of one or more equal-sized complete graphs, and their complements, the Turán graphs. A Young tableau (pl.: tableaux) is a combinatorial...