Startpage »
Projects »
Publications »
Ortelius classification »
Help »
Extremal graph problems with algebraic and probabilistic methods
Help
Print
Here you can view and search the projects funded by NKFI since 2004
Back »
Details of project
Identifier
134953
Type
PD
Principal investigator
Nagy, Zoltán Lóránt
Title in Hungarian
Extremális gráfelméleti problémák algebrai és valószínűségi módszerekkel
Title in English
Extremal graph problems with algebraic and probabilistic methods
Keywords in Hungarian
extremális kombinatorika, polinomok
Keywords in English
extremal combinatorics, polynomials
Discipline
Mathematics (Council of Physical Sciences)
100 %
Ortelius classification:
Combinatorial analysis
Panel
Mathematics and Computing Science
Department or equivalent
MTA-ELTE Geometric and Algebraic Combinatorics (Office for Research Groups Attached to Universities and Other Institutions)
Starting date
2020-09-01
Closing date
2024-08-31
Funding (in million HUF)
22.506
FTE (full time equivalent)
3.15
state
running project
Back »
PUBv2.02 - © National Research, Development And Innovation Office
Security
»
Legal disclaimer
»
Sitemap
»
Impressum
»
Contact
»