Patrick Bennett

activity

20122026

most citedA natural barrier in random greedy hypergraph matching

19 citations · 46 across the 26 of their papers we have counts for

collaborators

40 papers

math.CO2026

Almost-perfect packings and Tuza's conjecture in the random geometric graph

Patrick Bennett, Ryan Cushman, Andrzej Dudek +1

The triangle packing number $ν (G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$ . Tuza conjectured that in any graph $G$ there exists a set of at mo…

math.CO2025

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2 k}$

Deepak Bal, Patrick Bennett

The generalized Ramsey number $r (G, H, q)$ is the minimum number of colors needed to color the edges of $G$ such that every isomorphic copy of $H$ has at least $q$ colors. In this…

math.CO2024

The generalized Ramsey number $f (n, 5, 8) = \frac{6}{7} n + o (n)$

Patrick Bennett, Ryan Cushman, Andrzej Dudek

A $(p, q)$ -coloring of $K_{n}$ is a coloring of the edges of $K_{n}$ such that every $p$ -clique has at least $q$ distinct colors among its edges. The generalized Ramsey number $f(n, p,…

math.CO2024

Generalized Ramsey numbers of cycles, paths, and hypergraphs

Deepak Bal, Patrick Bennett, Emily Heath +1

Given a $k$ -uniform hypergraph $G$ and a set of $k$ -uniform hypergraphs $H$ , the generalized Ramsey number $f (G, H, q)$ is the minimum number of colors needed to…

math.CO2023

Generalized Ramsey numbers at the linear and quadratic thresholds

Patrick Bennett, Ryan Cushman, Andrzej Dudek

The generalized Ramsey number $f (n, p, q)$ is the smallest number of colors needed to color the edges of the complete graph $K_{n}$ so that every $p$ -clique spans at least $q$ colors…

math.CO2023★ 2 cited

Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class

Patrick Bennett, Emily Heath, Shira Zerbib

Recently, Alon introduced the notion of an $H$ -code for a graph $H$ : a collection of graphs on vertex set $[n]$ is an $H$ -code if it contains no two members whose symmetric differe…

Almost-perfect packings and Tuza's conjecture in the random geometric graph

Edge-coloring Kn,n​ with no 2-colored C2k​

The generalized Ramsey number f(n,5,8)=76​n+o(n)

Generalized Ramsey numbers of cycles, paths, and hypergraphs

Generalized Ramsey numbers at the linear and quadratic thresholds

Edge-coloring a graph G so that every copy of a graph H has an odd color class

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2 k}$

The generalized Ramsey number $f (n, 5, 8) = \frac{6}{7} n + o (n)$

Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class