Projects funded by the NCN
Matchings in hypergraphs.
2012/05/N/ST1/02773
Keywords:
extremal graph theory hypergraphs matchings
Descriptors:
- ST1_14: Discrete mathematics and combinatorics
Panel:
ST1 - Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics
Host institution :
Uniwersytet im. Adama Mickiewicza w Poznaniu, Wydział Matematyki i Informatyki
woj. wielkopolskie
Principal investigator (from the host institution):
dr Katarzyna Mieczkowska-Chwedyna
Number of co-investigators in the project: 2
Call: PRELUDIUM 3 - announced on 2012-03-15
Amount awarded: 63 050 PLN
Project start date (Y-m-d): 2013-03-18
Project end date (Y-m-d): 2015-12-17
Project duration:: 33 months (the same as in the proposal)
Project status: Project settled
Information in the final report
- Publication in academic press/journals (1)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variablesAuthors:Tomasz Łuczak, Katarzyna Mieczkowska, Matas ŠileikisAcademic press:Statistics & Probability Letters (rok: 2017, tom: 129, strony: 6), Wydawca: ElsevierStatus:PublishedDOI:10.1016/j.spl.2017.04.024 - link to the publication