Richard Snyder

activity

20162020

{C_{3}, C_{5}}

-free graphs

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

collaborators

11 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

The Erdős-Hajnal conjecture for three colors and multiple forbidden patterns

Maria Axenovich, Richard Snyder, Lea Weber

Erdős and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at le…

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.CO2018

Highly linked tournaments with large minimum out-degree

António Girão, Richard Snyder

We prove that there exists a function $f : N \to N$ such that for any positive integer $k$ , if $T$ is a strongly $4 k$ -connected tournament with minimum out-…

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

Disjoint pairs in set systems with restricted intersection

António Girão, Richard Snyder

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoin…

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…

math.CO2016★ 1 cited

The homomorphism threshold of ${C_{3}, C_{5}}$ -free graphs

Shoham Letzter, Richard Snyder

We determine the structure of ${C_{3}, C_{5}}$ -free graphs with $n$ vertices and minimum degree larger than $n /5$ : such graphs are homomorphic to the graph obtained from a $(5 k - 3)$ …

math.CO2016

A Stability Theorem for Maximal $K_{r + 1}$ -free Graphs

Kamil Popielarz, Julian Sahasrabudhe, Richard Snyder

For $r \geq 2$ , we show that every maximal $K_{r + 1}$ -free graph $G$ on $n$ vertices with $(1 - \frac{1}{r}) \frac{n ^{2}}{2} - o (n^{\frac{r + 1}{r}})$ edges contains a complete $r$ -partite s…

Strong complete minors in digraphs

The Erdős-Hajnal conjecture for three colors and multiple forbidden patterns

Bipartite independence number in graphs with bounded maximum degree

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

Subdivisions of digraphs in tournaments

Highly linked tournaments with large minimum out-degree

On the maximum diameter of path-pairable graphs

Disjoint pairs in set systems with restricted intersection

On the maximum degree of path-pairable planar graphs

The homomorphism threshold of {C3​,C5​}-free graphs

A Stability Theorem for Maximal Kr+1​-free Graphs

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

The homomorphism threshold of ${C_{3}, C_{5}}$ -free graphs

A Stability Theorem for Maximal $K_{r + 1}$ -free Graphs