Bartlomiej Kielak

Orcid: 0000-0002-8904-4485

According to our database¹, Bartlomiej Kielak authored at least 6 papers between 2021 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

The Generalized Trifference Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2026

2025

Constricting the Computational Complexity Gap of the 4-Coloring Problem in (P<sub>t</sub>,C<sub>3</sub>)-free Graphs.

[BibT_eX]

[DOI]

CoRR, September, 2025

2023

Quasirandom-Forcing Orientations of Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

2022

On the maximum number of odd cycles in graphs without smaller odd cycles.

[BibT_eX]

[DOI]

Andrzej Grzesik

Bartlomiej Kielak

J. Graph Theory, 2022

On the inducibility of oriented graphs on four vertices.

[BibT_eX]

[DOI]

Lukasz Bozyk

Andrzej Grzesik

Bartlomiej Kielak

Discret. Math., 2022

2021

Exact hyperplane covers for subsets of the hypercube.

[BibT_eX]

[DOI]

Discret. Math., 2021

Bartlomiej Kielak

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...