William Lochet

most citedA proof of the Erdős-Sands-Sauer-Woodrow conjecture

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

collaborators

5 papers

math.CO2017

Immersion of transitive tournaments in digraphs with large minimum outdegree

W. Lochet

We prove the existence of a function $h (k)$ such that every simple digraph with minimum outdegree greater than $h (k)$ contains an immersion of the transitive tournament on $k$ vert…

math.CO2017★ 2 cited

A proof of the Erdős-Sands-Sauer-Woodrow conjecture

N. Bousquet, W. Lochet, S. Thomassé

A very nice result of Bárány and Lehel asserts that every finite subset $X$ or $R^{d}$ can be covered by $f (d)$ $X$ -boxes (i.e. each box has two antipodal points in $X$ ). As…

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…

math.CO2016

Subdivisions of oriented cycles in digraphs with large chromatic number

Nathann Cohen, Frédéric Havet, William Lochet +1

An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle $C$ , there are digraphs containing no subdivision of $C$ (as a subdigraph) and…

math.CO2016

Equitable orientations of sparse uniform hypergraphs

Nathann Cohen, William Lochet

Caro, West, and Yuster studied how $r$ -uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped…