Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Algorithmic Local Lovász Lemma as double counting

2011/01/D/ST1/04412

Keywords:

Lovász Local Lemma double counting analytic combinatorics Thue sequences hypergraph coloring

Descriptors:

  • ST1_14: Discrete mathematics and combinatorics
  • ST1_15: Mathematical aspects of computer science

Panel:

ST1 - Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics

Host institution :

Uniwersytet Jagielloński, Wydział Matematyki i Informatyki

woj. małopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Jakub Kozik 

Number of co-investigators in the project: 2

Call: SONATA 1 - announced on 2011-03-15

Amount awarded: 374 400 PLN

Project start date (Y-m-d): 2011-12-01

Project end date (Y-m-d): 2014-11-30

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Information in the final report

  • Publication in academic press/journals (6)
  1. A note on random greedy coloring of uniform hypergraphs
    Authors:
    Danila D. Cherkashin, Jakub Kozik
    Academic press:
    RANDOM STRUCTURES & ALGORITHMS (rok: 2015, tom: 47, Issue 3, strony: 407-413), Wydawca: WILEY-BLACKWELL, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA
    Status:
    Published
    DOI:
    10.1002/rsa.20556 - link to the publication
  2. Improved algorithms for colorings of simple hypergraphs and applications
    Authors:
    Jakub Kozik, Dmitry Shabanov
    Academic press:
    Journal of Combinatorial Theory, Series B (rok: 2016, tom: 116, strony: 312-332), Wydawca: ACADEMIC PRESS INC ELSEVIER SCIENCE, 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495
    Status:
    Published
    DOI:
    10.1016/j.jctb.2015.09.004 - link to the publication
  3. Multipass greedy coloring of simple uniform hypergraphs
    Authors:
    Jakub Kozik
    Academic press:
    RANDOM STRUCTURES & ALGORITHMS (rok: 2016, tom: 48, Issue 1, strony: 125-146), Wydawca: WILEY-BLACKWELL, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA
    Status:
    Published
    DOI:
    10.1002/rsa.20613 - link to the publication
  4. Nonrepetitive Colouring via Entropy Compression
    Authors:
    Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
    Academic press:
    COMBINATORICA (rok: 2013, tom: -, strony: -), Wydawca: SPRINGER, 233 SPRING ST, NEW YORK, NY 10013
    Status:
    Accepted for publication
    DOI:
    10.1007/s00493-015-3070-6 - link to the publication
  5. New approach to nonrepetitive sequences
    Authors:
    Jarosław Grytczuk, Jakub Kozik, Piotr Micek
    Academic press:
    RANDOM STRUCTURES & ALGORITHMS (rok: 2013, tom: 42(2), strony: 214-225), Wydawca: WILEY-BLACKWELL, 111 RIVER ST, HOBOKEN 07030-5774, NJ USA
    Status:
    Published
    DOI:
    10.1002/rsa.20411 - link to the publication
  6. Nonrepetitive choice number of trees
    Authors:
    Jakub Kozik, Piotr Micek
    Academic press:
    SIAM J. Discrete Math. (rok: 2013, tom: 27-1, strony: 436-446), Wydawca: SIAM PUBLICATIONS, 3600 UNIV CITY SCIENCE CENTER, PHILADELPHIA, PA 19104-2688 USA
    Status:
    Published
    DOI:
    10.1137/120866361 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy