About

I am a ph.d-student in the AlgoLoG section at the Technical University of Denmark. I started my ph.d in August 2016 under the supervision of Professor Carsten Thomassen.

My research interests include problems on colourings, decompositions and edge-weightings. In particular I work on the 1-2-3 conjecture and problems related to that.

2016 - MSc. Mathematics, Technical University of Denmark. Advisor: Professor Carsten Thomassen.

Preprints and Publications

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture. (with J. Bensmail and M. Senhaji). Discrete Mathematics and Theoretical Computer Science 19 (2017) no. 1. Link.

On Neighbour Sum-Distinguishing {0,1}-Edge-Weightings of Bipartite Graphs. Discrete Mathematics and Theoretical Computer Science 20 (2018) no. 1. Link.

Vertex Colouring Edge Weightings: a Logarithmic Upper Bound on Weight-Choosability. (with L. Zhong), 2017. Submitted.

A Generalized Version of a Local Antimagic Labelling Conjecture. (with L. Zhong). Graphs and Combinatorics 34, (2018) 1363-1369. Link.

Spanning trees without adjacent vertices of degree 2. (with M. Merker), 2018. arXiv: 1801.07025. Submitted. Link

Decomposing graphs into a spanning tree, an even graph, and a star forest. (with M. Merker). The Electronic Journal of Combinatorics 26(1) (2018) #P1.33. Link.

On {a,b}-edge-weightings of bipartite graphs with odd a,b. (with J. Bensmail and F. Inerney), 2019. Submitted.

Conferences, Workshops and External Stays

November 2016 - Bordeaux Graph Workshop, Université de Bordeaux, France.

September-December 2017 - Research stay at University of Waterloo, Ontario, Canada.

July 2018 - 10'th International Colloquium on Graph Theory and Combinatorics, Université de Lyon, France.

August 2018 - GT2018, University of Southern Denmark, Denmark.

November 2018 - Kolkom 2018, University of Paderborn, Germany.