Julien Duron

activity

20232026

most citedA tamed family of triangle-free graphs with unbounded chromatic number

2 citations · 4 across the 15 of their papers we have counts for

collaborators

Showing 2024Show all

4 papers · 1 filter

cs.DM2024

Long induced paths and forbidden patterns: Polylogarithmic bounds

Julien Duron, Louis Esperet, Jean-Florent Raymond

Consider a graph $G$ with a long path $P$ . When is it the case that $G$ also contains a long induced path? This question has been investigated in general as well as within a number…

math.CO2024

Long induced paths in sparse graphs and graphs with forbidden patterns

Julien Duron, Louis Esperet, Jean-Florent Raymond

Consider a graph $G$ with a path $P$ of order $n$ . What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced path…

math.CO2024

Adjacency Labeling Schemes for Small Classes

Édouard Bonnet, Julien Duron, John Sylvester +1

A graph class admits an implicit representation if, for every positive integer $n$ , its $n$ -vertex graphs have a $O (lo g n)$ -bit (adjacency) labeling scheme, i.e., their vertices c…

cs.DS2024

Symmetric-Difference (Degeneracy) and Signed Tree Models

Édouard Bonnet, Julien Duron, John Sylvester +1

We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-diffe…