other camps. While imprisoned, Turán came up with some of his best theories, which he was able to publish after the war. Turán had a long collaboration with...

contains a block. The Turán number T(n,k,r) is the minimum size of such a system. The complements of the lines of the Fano plane form a Turán (7,5,4)-system...

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

show that the Turán graphs are chromatically unique: no other graphs have the same chromatic polynomials. Nikiforov (2005) uses Turán graphs to supply...

expresses the desired properties. Dependent random choice can help find the Turán number. Using appropriate parameters, if H = A ∪ B {\displaystyle H=A\cup B}...

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 edges among all...

season, Turan was handed the captaincy of Galatasaray and given squad number 10, which had previously belonged to Metin Oktay and Hagi; Turan previously...

The Erdős–Turán conjecture is an old unsolved problem in additive number theory (not to be confused with Erdős conjecture on arithmetic progressions) posed...

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

conjecture Scientific classification Cladistics Neighbor-joining Phenetics Turán number Shannon switching game Spectral graph theory Spring-based algorithm Strongly...

and Pál Turán in 1948. Let μ be a probability measure on the unit circle R/Z. The Erdős–Turán inequality states that, for any natural number n, sup A...

Look up Turanism in Wiktionary, the free dictionary. Turanism, also known as Turanianism, pan-Turanism or pan-Turanianism, is a pan-nationalist political...

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

decided to use the base of the Turán tank as it was a proven, solid chassis already in use in the Hungarian army. Proving the Turán tank was a successful armament...

for G = K r {\displaystyle G=K_{r}} . Equality cases for Turán's theorem come from the Turán graph T ( n , r − 1 ) {\displaystyle T(n,r-1)} . This result...

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

Vera Turán Sós (11 September 1930 – 22 March 2023) was a Hungarian mathematician who specialized in number theory and combinatorics. She was a student...

problem asks for the minimum number of crossings in a drawing of a complete bipartite graph. The problem is named after Pál Turán, who formulated it while...

determines the Turán density for all graphs, showing that any graph H {\displaystyle H} with chromatic number r > 2 {\displaystyle r>2} has a Turán density of...

random number generator (HRNG), true random number generator (TRNG), non-deterministic random bit generator (NRBG), or physical random number generator...

sieve Selberg sieve Sieve of Atkin Sieve of Eratosthenes Sieve of Sundaram Turán sieve Chen prime Cullen prime Fermat prime Sophie Germain prime, safe prime...

called Chebyshev's bias. The prime number race generalizes to other moduli and is the subject of much research; Pál Turán asked whether it is always the case...

as a special case of the Kővári–Sós–Turán theorem. More precisely, in this case it is known that the maximum number of edges in a 4-cycle-free graph is...

arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural density contains...

goes to infinity. A simple proof to the result was given by Pál Turán, who used the Turán sieve to prove that ∑ n ≤ x | ω ( n ) − log ⁡ log ⁡ x | 2 ≪ x...

radical political Turanists left the Turan Society, and formed the "Turan Federation of Hungary" (Magyarországi Turán Szövetség). In 1920, Archduke Joseph...

Symmetric functions Szemerédi's theorem Thue–Morse sequence Tower of Hanoi Turán number Turing tarpit Union-closed sets conjecture Urn problems (probability)...

find the exact value of the discrepancy of large point sets. The Erdős–Turán–Koksma inequality provides an upper bound. Let x 1 , … , x N {\displaystyle...

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

The Erdős number (Hungarian: [ˈɛrdøːʃ]) describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship...