**Tomasz Łuczak** (born 13 March 1963 in Poznań)^{ [1] } is a Polish mathematician and professor at Adam Mickiewicz University in Poznań and Emory University. His main field of research is combinatorics, specifically discrete structures, such as random graphs, and their chromatic number.^{ [2] }

Under supervision of Michał Karoński, Łuczak earned his doctorate at Adam Mickiewicz University in Poznań in 1987.^{ [3] } In 1992, he was awarded the EMS Prize and in 1997 he received the prestigious Prize of the Foundation for Polish Science for his work on the theory of random discrete structures.

**Béla Bollobás** FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős since the age of 14.

The **Adam Mickiewicz University** is a research university in Poznań, Poland.

In graph theory, a **strong coloring**, with respect to a partition of the vertices into (disjoint) subsets of equal sizes, is a (proper) vertex coloring in which every color appears exactly once in every part. A graph is **strongly k-colorable** if, for each partition of the vertices into sets of size

The **Fulkerson Prize** for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

In the mathematical area of graph theory, a **triangle-free graph** is an undirected graph in which no three vertices form a triangle of edges. Triangle-free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4, graphs with no induced 3-cycle, or locally independent graphs.

**Václav (Vašek) Chvátal** (Czech: [ˈvaːtslaf ˈxvaːtal] is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

**András Hajnal** was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.

**Czesław Łuczak** was a Polish historian focusing on World War II. He served as Rector of the Adam Mickiewicz University in Poznań from 1965 to 1972; and, from 1969 to 1981 and from 1987 to 1991, as Director of the University's Institute of History. He was a member of the Polish United Workers' Party in communist Poland.

* László Pyber* is a Hungarian mathematician. He is a researcher at the Alfréd Rényi Institute of Mathematics, Budapest. He works in combinatorics and group theory.

**Norman Linstead Biggs** is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.

In graph theory, a ** k-degenerate graph** is an undirected graph in which every subgraph has a vertex of degree at most

**Svante Janson** is a Swedish mathematician. A member of the Royal Swedish Academy of Sciences since 1994, Janson has been the chaired professor of mathematics at Uppsala University since 1987.

**Péter Komjáth** is a Hungarian mathematician, working in set theory, especially combinatorial set theory. Komjáth is a professor at the Eötvös Loránd University. He is currently a visiting faculty member at Emory University in the department of Mathematics and Computer Science.

**Bruce Alan Reed**FRSC is a Canadian mathematician and computer scientist, the Canada Research Chair in Graph Theory and a professor of computer science at McGill University. His research is primarily in graph theory.

**Paul Allen Catlin** was a mathematician, professor of mathematics and Doctor of Mathematics, known for his valuable contributions to graph theory and number theory. He wrote one of the most cited papers in the series of chromatic numbers and Brooks' theorem, titled * Hajós graph coloring conjecture: variations and counterexamples*.

**Zygmunt Władysław Vetulani** is a Polish mathematician and computer scientist who specializes in language engineering and artificial intelligence, professor of technical sciences and professor at the Adam Mickiewicz University where he is also Head of the Department of Information Linguistics and Artificial Intelligence.

**Paweł Leszkowicz** is a Polish art historian and art curator. He works as a lecturer and researcher at the Department of History of Art, Adam Mickiewicz University in Poznań, and lectures at the University of Fine Arts in Poznań. He is a member of International Association of Art Critics.

**Wacław Bolesław Marzantowicz** is a Polish mathematician known for his contributions in the number theory and topology, President of Polish Mathematical Society (2014–2019).

**Wacław Bolesław Marzantowicz** is a Polish mathematician known for his contributions in number theory and topology. He was President of Polish Mathematical Society between 2014–2019.

The **Collegium Polonicum** in Słubice is a joint academic unit of the Adam Mickiewicz University in Poznań and of the Viadrina European University in Frankfurt (Oder). Its focus is on interdisciplinary scientific research and teaching on German-Polish, European, intercultural and cross-border issues. Collegium Polonicum is also a branch of the Adam Mickiewicz University in Słubice, in whose building this joint unit is physically based. This building had been erected in the years 1992-2001 by the Adam Mickiewicz University for the purpose of joint research and teaching activities with the Viadrina European University. As branch of Adam Mickiewicz University, Collegium Polonicum is one of four such units located outside Poznań and notably housing the *Academic Secondary School for General Education in Słubice*.

- ↑ Joseph A., Mignot F., Murat F., Prum B., Rentschler R. (1994.)
*First**European Congress of Mathematics Paris, July 6–10, 1992: Vol. 1: Invited Lectures*, Nelson Thornes. - ↑ ——— (1991). "The chromatic number of random graphs".
*Combinatorica*.**11**(1): 45–54. doi:10.1007/BF01375472. S2CID 189917450. - ↑ Tomasz Łuczak at the Mathematics Genealogy Project

This article about a Polish scientist is a stub. You can help Wikipedia by expanding it. |

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.