F. Havet

activity

20062026

most citedA Variant of the Erdős-Sós Conjecture

16 citations · 97 across the 26 of their papers we have counts for

collaborators

Showing 2017Show all

5 papers · 1 filter

math.CO2017★ 4 cited

Finding a subdivision of a prescribed digraph of order 4

Frédéric Havet, A. Karolinna Maia, Bojan Mohar

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algor…

cs.DM2017★ 2 cited

Bipartite spanning sub(di)graphs induced by 2-partitions

Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1

For a given $2$ -partition $(V_{1}, V_{2})$ of the vertices of a (di)graph $G$ , we study properties of the spanning bipartite subdigraph $B_{G} (V_{1}, V_{2})$ of $G$ induced by those arcs/edges…

cs.DM2017

Out-degree reducing partitions of digraphs

Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet +1

Let $k$ be a fixed integer. We determine the complexity of finding a $p$ -partition $(V_{1}, \dots, V_{p})$ of the vertex set of a given digraph such that the maximum out-degree of each…

cs.DS2017

Complexity Dichotomies for the Minimum F-Overlay Problem

Nathann Cohen, Frédéric Havet, Dorian Mazauric +2

For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of…

math.CO2017

Bispindles in strongly connected digraphs with large chromatic number

N. Cohenn, F. Havet, W. Lochet +1

A $(k_{1} + k_{2})$ -bispindle is the union of $k_{1}$ $(x, y)$ -dipaths and $k_{2}$ $(y, x)$ -dipaths, all these dipaths being pairwise internally disjoint. Recently, Cohen et al. showed that fo…