Matthew Brennan

activity

20152022

most citedReducibility and Computational Lower Bounds for Problems with Planted Sparse Structure

31 citations · 123 across the 9 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

Ramsey numbers of trees versus odd cycles

Matthew Brennan

Burr, Erdős, Faudree, Rousseau and Schelp initiated the study of Ramsey numbers of trees versus odd cycles, proving that $R (T_{n}, C_{m}) = 2 n - 1$ for all odd $m \geq 3$ and $n \ge 756…

math.CO2015

Ramsey numbers of trees and unicyclic graphs versus fans

Matthew Brennan

The generalized Ramsey number $R (H, K)$ is the smallest positive integer $n$ such that for any graph $G$ with $n$ vertices either $G$ contains $H$ as a subgraph or its complement $…