Patrick Bennett

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The generalized Ramsey number \(f(n,5,8)=\frac{6}{7}n+o(n)\)
Journal of Graph Theory
2026-06-11Paper
On generalized Ramsey numbers in the non-integral regime
The Electronic Journal of Combinatorics
2026-04-29Paper
The intersection of a random geometric graph with an Erdős-Rényi graph
Discrete Applied Mathematics
2026-04-17Paper
Generalized Ramsey numbers of cycles, paths, and hypergraphs
European Journal of Combinatorics
2026-01-29Paper
Extending Wormald's differential equation method to one-sided bounds
Combinatorics, Probability and Computing
2025-12-30Paper
Asymptotically optimal constant weight codes with even distance
Designs, Codes and Cryptography
2025-12-01Paper
A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers
The Electronic Journal of Combinatorics
2025-05-30Paper
Weighted tree games
The Electronic Journal of Combinatorics
2025-05-06Paper
Some online maker-breaker games
Discrete Mathematics
2025-03-11Paper
Generalized Ramsey numbers at the linear and quadratic thresholds
The Electronic Journal of Combinatorics
2025-03-06Paper
A note on non-isomorphic edge-color classes in random graphs
Graphs and Combinatorics
2024-12-09Paper
On the intersecting family process
The Electronic Journal of Combinatorics
2024-11-09Paper
The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
Journal of Combinatorial Theory. Series B
2024-10-08Paper
Weighted tree games2023-11-18Paper
Generalized Ramsey numbers at the linear and quadratic thresholds2023-08-31Paper
Larger matchings and independent sets in regular uniform hypergraphs of high girth2023-07-28Paper
Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class2023-07-03Paper
Rainbow Greedy Matching Algorithms2023-07-02Paper
Extending Wormald's Differential Equation Method to One-sided Bounds2023-02-23Paper
The matching process and independent process in random regular graphs and hypergraphs
The Electronic Journal of Combinatorics
2023-01-17Paper
On the chromatic number of random regular hypergraphs2022-12-30Paper
On generalized Ramsey numbers in the non-integral regime2022-12-20Paper
A random coloring process gives improved bounds for the Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers2022-12-13Paper
A note on non-isomorphic edge-color classes in random graphs2022-10-05Paper
A gentle introduction to the differential equation method and dynamic concentration
Discrete Mathematics
2022-09-26Paper
The Erd\H{o}s-Gy\'arf\'as function $f(n, 4, 5) = \frac 56 n + o(n)$ -- so Gy\'arf\'as was right2022-07-06Paper
The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
The Electronic Journal of Combinatorics
2022-02-01Paper
Closing the random graph gap in Tuza's conjecture through the online triangle packing process
SIAM Journal on Discrete Mathematics
2021-10-18Paper
On the number of alternating paths in random graphs
Discrete Applied Mathematics
2021-09-30Paper
Large triangle packings and Tuza's conjecture in sparse random graphs
Combinatorics, Probability and Computing
2021-04-30Paper
Zero-forcing in random regular graphs
Journal of Combinatorics
2021-02-08Paper
The bipartite \(K_{2,2}\)-free process and bipartite Ramsey number \(b(2, t)\)
The Electronic Journal of Combinatorics
2020-11-05Paper
A natural barrier in random greedy hypergraph matching
Combinatorics, Probability and Computing
2020-04-06Paper
Minimizing the number of 5-cycles in graphs with given edge-density
Combinatorics, Probability and Computing
2020-04-06Paper
The sum-free process
The Electronic Journal of Combinatorics
2020-01-17Paper
The sum-free process
The Electronic Journal of Combinatorics
2020-01-17Paper
Weighted Turán problems with applications
Discrete Mathematics
2019-08-20Paper
Large monochromatic components and long monochromatic cycles in random hypergraphs
European Journal of Combinatorics
2018-12-20Paper
A greedy algorithm for finding a large 2‐matching on a random cubic graph
Journal of Graph Theory
2018-08-16Paper
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Random Structures & Algorithms
2017-12-13Paper
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
Random Structures & Algorithms
2017-12-13Paper
Adding random edges to create the square of a Hamilton cycle2017-10-07Paper
On the number of alternating paths in bipartite complete graphs
Graphs and Combinatorics
2017-08-10Paper
Space proof complexity for random 3-CNFs
Information and Computation
2017-08-08Paper
On the Ramsey-Turán number with small s-independence number
Journal of Combinatorial Theory. Series B
2016-11-25Paper
Square of a Hamilton cycle in a random graph2016-11-20Paper
Rainbow arborescence in random digraphs
Journal of Graph Theory
2016-11-16Paper
A note on the random greedy independent set algorithm
Random Structures & Algorithms
2016-11-09Paper
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
The Electronic Journal of Combinatorics
2016-07-06Paper
Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
The Electronic Journal of Combinatorics
2016-07-06Paper
The total acquisition number of random graphs
The Electronic Journal of Combinatorics
2016-07-06Paper
The total acquisition number of random graphs
The Electronic Journal of Combinatorics
2016-07-06Paper
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics
2015-02-19Paper
Power of \(k\) choices and rainbow spanning trees in random graphs
The Electronic Journal of Combinatorics
2015-02-19Paper
The \(t\)-tone chromatic number of random graphs
Graphs and Combinatorics
2014-09-19Paper
Integer-magic spectra of trees of diameter five2009-04-14Paper
scientific article; zbMATH DE number 5239123 (Why is no real title available?)2008-02-22Paper
On the intersecting family process
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Patrick Bennett