Lea Weber

activity

20182025

most citedAbsolutely avoidable order-size pairs in hypergraphs

1 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Unavoidable order-size pairs in hypergraphs -- positive forcing density

Maria Axenovich, József Balogh, Felix Christian Clemen +1

Erdős, Füredi, Rothschild and Sós initiated a study of classes of graphs that forbid every induced subgraph on a given number $m$ of vertices and number $f$ of edges. Extending the…

math.CO2022★ 1 cited

Absolutely avoidable order-size pairs in hypergraphs

Lea Weber

For fixed integer $r \geq 2$ , we call a pair $(m, f)$ of integers, $m \geq 1$ , $0 \leq f \leq (r m)$ , $ab so l u t e l y$ $a v o i d ab l e$ if there is $n_{0}$ , such that for any pair of intege…