Richard Snyder

activity

20172020

collaborators

6 papers

math.CO2020

Strong complete minors in digraphs

Maria Axenovich, António Girão, Richard Snyder +1

Kostochka and Thomason independently showed that any graph with average degree $Ω (r lo g r)$ contains a $K_{r}$ minor. In particular, any graph with chromatic number $Ω(r\sqrt{…

math.CO2020

Bipartite independence number in graphs with bounded maximum degree

Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder +1

We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite…

math.CO2019

$(2 k + 1)$ -connected tournaments with large minimum out-degree are $k$ -linked

António Girão, Kamil Popielarz, Richard Snyder

Pokrovskiy conjectured that there is a function $f : N \to N$ such that any $2 k$ -strongly-connected tournament with minimum out and in-degree at least $f(k…

math.CO2019

Subdivisions of digraphs in tournaments

António Girão, Kamil Popielarz, Richard Snyder

We show that for every positive integer $k$ , any tournament with minimum out-degree at least $(2 + o (1)) k^{2}$ contains a subdivision of the complete directed graph on $k$ vertices, wh…

math.CO2017

On the maximum diameter of path-pairable graphs

Antonio Girao, Gabor Meszaros, Kamil Popielarz +1

A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diamet…

math.CO2017

On the maximum degree of path-pairable planar graphs

António Girão, Gábor Mészáros, Kamil Popielarz +1

A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in…