2 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 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 m…
math.PR2026
The critical activation density in graph bootstrap percolation
Brett Kolesnik, Tamás Makai, Tamás Makai +6
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…