Joel Danielsson

Lecturer

Lund University
Country flagSweden

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Joel Danielsson is an Assistant Professor at Lund University in Sweden. His research focuses on areas such as combinatorial optimization, random structures, and algorithmic analysis, as evidenced by his recent publications on minimal H-factors, polarized random κ-SAT, and the dynamics of covering times for structured coupon collectors. With a robust portfolio of contributions to the field, he is actively engaged in advancing the understanding of complex mathematical frameworks.

Articles (5)

Given a fixed small graph H and a larger graph G , an H -factor is a collection of vertex-disjoint subgraphs $H'\subset G$ , each isomorphic to H , that cover the vertices of G . If G is the complete graph $K_n$ equipped with independent U (0,1) edge weights, what is the lowest total weight of an H -factor? This problem has previously been considered for $H=K_2$ , for example. We show that if H contains a cycle, then the minimum weight is sharply concentrated around some $L_n = \Theta(n^{1-1/d^*})$ (where $d^*$ is the maximum 1-density of any subgraph of H ). Some of our results also hold for H -covers, where the copies of H are not required to be vertex-disjoint.

Year:

2025

Year:

2023

Year:

2021

Year:

2021

Year:

2020

Collaborators (1)

Victor Falgas-Ravry

Associate professor

Umea University

SWEDEN
View details