Search results
The page ""Turán" journal" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
Pál Turán (Hungarian: [ˈpaːl ˈturaːn]; 18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily...19 KB (2,194 words) - 11:35, 1 April 2024
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...10 KB (1,262 words) - 13:42, 15 July 2024- Turán's theorem (redirect from Turán theorem)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...20 KB (3,258 words) - 16:52, 5 June 2024
- 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)...10 KB (1,730 words) - 07:34, 29 June 2024
rectilinear crossing numbers equal to their crossing numbers. Turán, P. (1977), "A note of welcome", Journal of Graph Theory, 1: 7–9, doi:10.1002/jgt.3190010105...13 KB (1,513 words) - 08:14, 11 January 2024- referred to as the Erdős–Turán conjecture, is a conjecture in arithmetic combinatorics (not to be confused with the Erdős–Turán conjecture on additive bases)...7 KB (889 words) - 05:48, 12 August 2024
- Zarankiewicz problem (redirect from Kövari–Sós–Turán theorem)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...26 KB (5,080 words) - 18:27, 6 July 2024
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 of crossings between...26 KB (3,160 words) - 12:46, 12 August 2024- 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...9 KB (1,405 words) - 18:19, 9 July 2024
- Remez inequality (redirect from Turán lemma)and the subset E is itself an interval, the inequality was proved by Pál Turán and is known as Turán's lemma. This inequality also extends to L p ( T )...7 KB (1,273 words) - 00:15, 30 August 2021
- 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...22 KB (2,482 words) - 07:49, 7 August 2024
- Turán is a Hungarian periodical. First it was issued during the years 1913, and 1917 through 1918. From 1998 it is being issued again bi-monthly by the...2 KB (216 words) - 07:00, 26 May 2020
unions of complete graphs. A Turán graph T(rs,r) is locally T((r-1)s,r-1). More generally any Turán graph is locally Turán. Every planar graph is locally...10 KB (1,122 words) - 08:52, 18 August 2023- Hardy–Ramanujan Journal, 30: 6–12, doi:10.46298/hrj.2007.156, MR 2440316 Turán, Pál (1934), "On a theorem of Hardy and Ramanujan", Journal of the London...5 KB (626 words) - 20:02, 22 July 2024
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...20 KB (2,496 words) - 08:26, 28 December 2023- Klaus Roth (section Journal papers)in Inverness". The Scotsman. Erdős, Paul; Turán, Paul (1936). "On some sequences of integers" (PDF). Journal of the London Mathematical Society. 11 (4):...30 KB (3,355 words) - 06:51, 6 May 2024
Golomb ruler (section Erdős–Turán construction)2009.3.235. Erdős, Paul; Turán, Pál (1941). "On a problem of Sidon in additive number theory and some related problems". Journal of the London Mathematical...17 KB (1,471 words) - 09:25, 20 December 2023- concepts include B h [ g ] {\displaystyle B_{h}[g]} -sequences and the Erdős–Turán conjecture on additive bases. Sidon's question was whether an economical...10 KB (1,718 words) - 05:58, 8 December 2022
- Springer. ISBN 978-3540668091. Erdős, Paul; Turán, Paul (1936), "On some sequences of integers" (PDF), Journal of the London Mathematical Society, 11 (4):...2 KB (250 words) - 11:17, 18 August 2023
- Forbidden subgraph problem (section Turán density)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...24 KB (4,298 words) - 08:07, 11 January 2024
- 4-orthoplex, hexadecachoron, octahedron 4-orthoplex simplex hypercube Turán graph ^ Conway, J. H., Sloane, N. J. A. (1991) “The Cell Structures of Certain
- i. ch. 2. [c. 1590.—"The fourth class (Turkí) are horses imported from Turán; though strong and well formed, they do not come up to the preceding (Arabs
- works of Ramsey on colorations and more specially the results obtained by Turán in 1941 was at the origin of another branch of graph theory, w:extremal