Search results

The Turán tanks were a series of Hungarian medium tanks of World War II. They were produced in two main variants: the original 40M Turán (or Turán I)...

the Turán II with the long-barreled and much more powerful 7.5 cm 43M tank gun. The armor was also improved, and the resulting tank became the Turán III...

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

The 43M Zrínyi II was a Hungarian assault gun of World War II based on the Turán medium tank chassis. The Zrínyi assault gun was used to fight against...

parts. The resulting graph is the Turán graph T ( n , r ) {\displaystyle T(n,r)} . Turán's theorem states that the Turán graph has the largest number of...

In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k...

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 such extremal graph. The Erdős–Stone...

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

The Turán–Kubilius inequality is a mathematical theorem in probabilistic number theory. It is useful for proving results about the normal order of an...

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

In number theory, the Turán sieve is a technique for estimating the size of "sifted sets" of positive integers which satisfy a set of conditions which...

modern Soviet tanks. To solve this problem, Hungary started to develop the Turán III and Zrínyi assault guns. However, it still tried to buy the license...

also did much work in analysis and graph theory. In 1934, Turán used the Turán sieve to give a new and very simple proof of a 1917 result of G. H. Hardy...

on r {\displaystyle r} vertices. T ( n , r ) {\displaystyle T(n,r)} is the Turán graph: a complete r {\displaystyle r} -partite graph on n {\displaystyle...

inspired by. Of the Turán series, the 40M Turán I was based on an incomplete prototype of the Czech Škoda T-21 (Š-II-c) medium tank, but the Turán I had improved...

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

MR 0340095. Füredi, Zoltan; Naor, Assaf; Verstraëte, Jacques (2006), "On the Turán number for the hexagon", Advances in Mathematics, 203 (2): 476–496, doi:10...

graphs mKn formed from the disjoint unions of isomorphic complete graphs, the Turán graphs formed as the complement graphs of mKn, the 3 × 3 rook's graph...

{1}{r}}{\bigg )}{\frac {n^{2}}{2}}} and that the maximum is attained uniquely by the Turán graph T n , r {\displaystyle T_{n,r}} . Both of these classic results...

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. Hadwiger's conjecture...