Patrick Bennett

Available identifiers

zbMath Open bennett.patrickMaRDI QIDQ345116

List of research outcomes

Publication	Date of Publication	Type
Weighted tree games	2023-11-18	Paper
Generalized Ramsey numbers at the linear and quadratic thresholds	2023-08-31	Paper
Larger matchings and independent sets in regular uniform hypergraphs of high girth	2023-07-28	Paper
Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class	2023-07-03	Paper
Rainbow Greedy Matching Algorithms	2023-07-02	Paper
Extending Wormald's Differential Equation Method to One-sided Bounds	2023-02-23	Paper
The matching process and independent process in random regular graphs and hypergraphs	2023-01-17	Paper
On the chromatic number of random regular hypergraphs	2022-12-30	Paper
On generalized Ramsey numbers in the non-integral regime	2022-12-20	Paper
A random coloring process gives improved bounds for the Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers	2022-12-13	Paper
A note on non-isomorphic edge-color classes in random graphs	2022-10-05	Paper
A gentle introduction to the differential equation method and dynamic concentration	2022-09-26	Paper
The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right	2022-07-06	Paper
The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2\)]	2022-02-01	Paper
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process	2021-10-18	Paper
On the number of alternating paths in random graphs	2021-09-30	Paper
Large triangle packings and Tuza’s conjecture in sparse random graphs	2021-04-30	Paper
Zero-forcing in random regular graphs	2021-02-08	Paper
The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)	2020-11-05	Paper
A natural barrier in random greedy hypergraph matching	2020-04-06	Paper
Minimizing the number of 5-cycles in graphs with given edge-density	2020-04-06	Paper
The sum-free process	2020-01-17	Paper
Weighted Turán problems with applications	2019-08-20	Paper
Large monochromatic components and long monochromatic cycles in random hypergraphs	2018-12-20	Paper
A greedy algorithm for finding a large 2‐matching on a random cubic graph	2018-08-16	Paper
Rainbow perfect matchings and Hamilton cycles in the random geometric graph	2017-12-13	Paper
Adding random edges to create the square of a Hamilton cycle	2017-10-07	Paper
On the number of alternating paths in bipartite complete graphs	2017-08-10	Paper
Space proof complexity for random 3-CNFs	2017-08-08	Paper
On the Ramsey-Turán number with small \(s\)-independence number	2016-11-25	Paper
Square of a Hamilton cycle in a random graph	2016-11-20	Paper
Rainbow Arborescence in Random Digraphs	2016-11-16	Paper
A note on the random greedy independent set algorithm	2016-11-09	Paper
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs	2016-07-06	Paper
The total acquisition number of random graphs	2016-07-06	Paper
Power of \(k\) choices and rainbow spanning trees in random graphs	2015-02-19	Paper
The \(t\)-tone chromatic number of random graphs	2014-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q3620527	2009-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q5442501	2008-02-22	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Patrick Bennett