Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Jakub Przybyło

AGH University of Science and Technology

Poland

Research Interests

Explore related searches

Professors in Poland

Articles (26)

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Collaborators (4)

Jarosław Grytczuk

University of Warsaw

POLAND

View details

Grzegorz Gutowski

Jagiellonian University

POLAND

View details

Marcin Anholcer

Associate professor

Poznań University of Economics and Business

POLAND

View details

Bartłomiej Pawlik

Silesian University of Technology

POLAND

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Jakub Przybyło

Research Interests

Explore related searches

Articles (26)

On asymptotically tight bound for the conflict-free chromatic index of nearly regular graphs

Words Avoiding Tangrams

Degree-balanced decompositions of cubic graphs

Mrs. Correct and majority colorings

On list extensions of the majority edge colourings

The irregularity strength of dense graphs — on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel

A note on decomposing graphs to locally almost irregular subgraphs

A note on the conflict-free chromatic index

Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment

Decomposability of regular graphs to 4 locally irregular subgraphs

Inclusion chromatic index of random graphs

On conflict-free proper colourings of graphs without small degree vertices

On triangle-free list assignments

On a problem of Steinhaus

On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs

Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture

A generalization of Faudree–Lehel conjecture holds almost surely for random graphs

Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees

Conflict-free chromatic number versus conflict-free chromatic index

The 1-2-3 conjecture holds for graphs with large enough minimum degree

Largest component and node fault tolerance for grids

On the inclusion chromatic index of a graph

On the standard (2, 2)-conjecture

The 1-2-3 Conjecture almost holds for regular graphs

On a total version of 1-2-3 conjecture

On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

Collaborators (4)

Jarosław Grytczuk

Grzegorz Gutowski

Marcin Anholcer

Bartłomiej Pawlik

Make your next move.