5 citations · 19 across the 20 of their papers we have counts for
24 papers
Almost-perfect packings and Tuza's conjecture in the random geometric graph
Patrick Bennett, Ryan Cushman, Andrzej Dudek +1
The triangle packing number of a graph is the maximum size of a set of edge-disjoint triangles in . Tuza conjectured that in any graph there exists a set of at mo…
The critical activation density in graph bootstrap percolation
Brett Kolesnik, Tamás Makai, Rajko Nenadov +3
In graph bootstrap percolation, edges of an Erdős-Rényi random graph are initially active, and activation spreads to other edges of via the combinatorics…
The Phase Transition of Discrepancy in Random Hypergraphs
Calum MacRury, Tomáš Masařík, Leilani Pai +1
Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on vertices and edges. In the first (edge-independent)…
Rainbow Hamilton Cycles in Random Geometric Graphs
Alan Frieze, Xavier Pérez-Giménez
Let be chosen independently and uniformly at random from the unit -dimensional cube . Let be given and let . The…
On the existence of Hamilton cycles with a periodic pattern in a random digraph
Alan Frieze, Xavier Perez-Gimenez, Pawel Pralat
We consider Hamilton cycles in the random digraph where the orientation of edges follows a pattern other than the trivial orientation in which the edges are oriented in t…
On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
Xavier Perez-Gimenez, Pawel Pralat, Douglas B. West
An ordered hypergraph is a hypergraph with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph in must respect the specified order…