1 citations · 2 across the 6 of their papers we have counts for
15 papers
On triangle-free list assignments
Jakub Przybyło
We show that Bernshteyn's proof of the breakthrough result of Molloy that triangle-free graphs are choosable from lists of size can be adapted to yield a stronger…
A note on the conflict-free chromatic index
Mateusz Kamyczura, Mariusz Meszka, Jakub Przybyło
Let be a graph with maximum degree and without isolated vertices. An edge colouring of is conflict-free if the closed neighbourhood of every edge includes a uniquel…
On the asymptotic confirmation of the Faudree-Lehel Conjecture for general graphs
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted by , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to…
Short proof of the asymptotic confirmation of the Faudree-Lehel Conjecture
Jakub Przybyło, Fan Wei
Given a simple graph , the {\it irregularity strength} of , denoted , is the least positive integer such that there is a weight assignment on edges $f: E(G) \to \{1…
Conflict-free chromatic number vs conflict-free chromatic index
Michał Dębski, Jakub Przybyło
A vertex coloring of a given graph is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). T…
The 1-2-3 Conjecture holds for graphs with large enough minimum degree
Jakub Przybyło
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can…