Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Order & Geometry

2018/31/G/ST1/03718

Keywords:

graph poset geometric represention chi-boundedness dimension

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 Jagielloński, Wydział Matematyki i Informatyki

woj. małopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Piotr Micek 

Number of co-investigators in the project: 5

Call: BEETHOVEN 3 - announced on 2018-09-14

Amount awarded: 771 713 PLN

Project start date (Y-m-d): 2020-01-15

Project end date (Y-m-d): 2023-10-14

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

Project status: Project completed

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

  • Publication in academic press/journals (3)
  • Articles in post-conference publications (2)
  1. Tight Bounds on the Clique Chromatic Number
    Authors:
    Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
    Academic press:
    Electronic Journal of Combinatorics (rok: 2021, tom: 28, Issue 3, strony: P3.51), Wydawca: ELECTRONIC JOURNAL OF COMBINATORICS
    Status:
    Published
    DOI:
    10.37236/9659 - link to the publication
  2. Adjacency labelling for planar graphs (and beyond)
    Authors:
    Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
    Academic press:
    Journal of the ACM (rok: 2021, tom: 68, strony: Article 42, pp. 1-33), Wydawca: ASSOC COMPUTING MACHINERY
    Status:
    Published
    DOI:
    10.1145/3477542 - link to the publication
  3. Improved Bounds for Centered Colorings
    Authors:
    Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
    Academic press:
    Advances in Combinatorics (rok: 2021, tom: 2021, strony: Artykuł 8), Wydawca: Alliance of Diamond Open Access Journals
    Status:
    Published
    DOI:
    10.19086/aic.27351 - link to the publication
  1. Adjacency labelling for planar graphs (and beyond)
    Authors:
    Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
    Conference:
    2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (rok: 2020, ), Wydawca: Institute of Electrical and Electronics Engineers (IEEE)
    Data:
    konferencja 16-19 listopada 2020
    Status:
    Published
  2. Reconfiguring Independent Sets on Interval Graphs
    Authors:
    Marcin Briański, Stefan Felsner, Jędrzej Hodor, Piotr Micek
    Conference:
    46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (rok: 2021, ), Wydawca: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
    Data:
    konferencja 44431
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy