Joseph Hyde

activity

20182026

most citedRamsey numbers of cycles versus general graphs

16 citations · 18 across the 7 of their papers we have counts for

collaborators

9 papers

math.CO2026

The threshold for the asymmetric vertex-Ramsey property in randomly perturbed graphs

Asier Calbet, Victor Falgas-Ravry, Joseph Hyde

For $r \geq 2$ and graphs $H_{1}, \dots, H_{r}, G$ , we say that $G$ is $(H_{1}, \dots, H_{r})$ vertex-Ramsey, or $(H_{1}, \dots, H_{r})_{v}$ -Ramsey, if whenever we colour the vertices of $G$ …

math.CO2023★ 1 cited

Proof of the Kohayakawa--Kreuter conjecture for the majority of cases

Candida Bowtell, Robert Hancock, Joseph Hyde

For graphs $G, H_{1}, \dots, H_{r}$ , write $G \to (H_{1}, \dots, H_{r})$ to denote the property that whenever we $r$ -colour the edges of $G$ , there is a monochromatic copy of $H_{i}$ in colou…

math.CO2022★ 1 cited

Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph

Alberto Espuny Díaz, Joseph Hyde

Let $G$ be a graph obtained as the union of some $n$ -vertex graph $H_{n}$ with minimum degree $δ (H_{n}) \geq α n$ and a $d$ -dimensional random geometric graph $G^{d} (n, r)$ . We investigate u…

math.CO2022

Disjoint isomorphic balanced clique subdivisions

Irene Gil Fernández, Joseph Hyde, Hong Liu +2

A thoroughly studied problem in Extremal Graph Theory is to find the best possible density condition in a host graph $G$ for guaranteeing the presence of a particular subgraph $H$ …

math.CO2021★ 16 cited

Ramsey numbers of cycles versus general graphs

John Haslegrave, Joseph Hyde, Jaehoon Kim +1

The Ramsey number $R (F, H)$ is the minimum number $N$ such that any $N$ -vertex graph either contains a copy of $F$ or its complement contains $H$ . Burr in 1981 proved a pleasingly g…

math.CO2021

Towards the 0-statement of the Kohayakawa-Kreuter conjecture

Joseph Hyde

In this paper, we study asymmetric Ramsey properties of the random graph $G_{n, p}$ . Let $r \in N$ and $H_{1}, \dots, H_{r}$ be graphs. We write $G_{n,p} \to (H_1, \ldots, H_r…

math.CO2021

On deficiency problems for graphs

Andrea Freschi, Joseph Hyde, Andrew Treglown

Motivated by analogous questions in the setting of Steiner triple systems and Latin squares, Nenadov, Sudakov and Wagner [Completion and deficiency problems, Journal of Combinatori…

math.CO2020

A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs

Candida Bowtell, Joseph Hyde

The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was…

math.CO2018

A degree sequence Komlós theorem

Joseph Hyde, Hong Liu, Andrew Treglown

An important result of Komlós [Tiling Turán theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$ -tiling…