Sós, Vera T.
Enlarge text Shrink text-
Save successfulThe item can be found in your Personal ZoneשגיאהLog in to your account to save
Information for Authority record
- Algebraic methods in graph theory, 1981:v. 1, t.p. (Vera T. Sós)
- LC data base, 11-25-83(hdg.: Sós, Vera T.)
- Irregularities of partitions, c1989:CIP t.p. (V.T. Sós) galley (Bolyai Mathematical Society, Budapest)
- Number theory, 1998:CIP t.p. (Vera T. Sós) data sht. (b. Sept. 11, 1930)
Wikipedia description:
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 and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, an analyst, number theorist, and combinatorist. Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Afterwards, she was employed by the Alfréd Rényi Institute of Mathematics. She was elected a corresponding member (1985) and member (1990) of the Hungarian Academy of Sciences. In 1997, Sós was awarded the Széchenyi Prize. One of her contributions is the Kővári–Sós–Turán theorem concerning the maximum possible number of edges in a bipartite graph that does not contain certain complete subgraphs. Another is the following so-called friendship theorem proved with Paul Erdős and Alfréd Rényi: if, in a finite graph, any two vertices have exactly one common neighbor, then some vertex is joined to all others. In number theory, Sós proved the three-gap theorem, conjectured by Hugo Steinhaus and proved independently by Stanisław Świerczkowski.
Read more on Wikipedia >