Richard Snyder

activity

20162020

{C_{3}, C_{5}}

-free graphs

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

collaborators

Showing 2019Show all

2 papers · 1 filter

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…

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

Subdivisions of digraphs in tournaments

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