3 citations · 7 across the 14 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
Bounds for Hypergraph Universality
Peter Allen, Julia Böttcher, Jasmin Katz
A graph is said to be universal for a class of graphs if contains a copy of every as a subgraph. The number of edges required for a host g…
math.CO2025
Robustness of the Sauer-Spencer Theorem
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define to be a random subgraph of obtained by retaining e…