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

12 papers

math.CO2025

Rainbow subgraphs of star-coloured graphs

Allan Lo, Klas Markström, Dhruv Mubayi +3

An edge-colouring of a graph $G$ can fail to be rainbow for two reasons: either it contains a monochromatic cherry (a pair of incident edges), or a monochromatic matching of size t…

math.CO2023

A note on multicolour Erdős-Hajnal conjecture

Maria Axenovich, Lea Weber

Informally, the Erdős-Hajnal conjecture (shortly EH-conjecture) asserts that if a sufficiently large host clique on $n$ vertices is edge-coloured avoiding a copy of some fixed edge…

math.CO2023

Large cliques or co-cliques in hypergraphs with forbidden order-size pairs

Maria Axenovich, Domagoj Bradač, Lior Gishboliner +2

The well-known Erdős-Hajnal conjecture states that for any graph $F$ , there exists $ε > 0$ such that every $n$ -vertex graph $G$ that contains no induced copy of $F$ has a homogeneous…

math.CO2023

Homogeneous sets in hypergraphs with forbidden order-size pairs

Maria Axenovich, Dhruv Mubayi, Lea Weber

The well-known Erdős-Hajnal conjecture states that for any graph $F$ , there exists $ε > 0$ such that every $n$ -vertex graph $G$ that contains no induced copy of $F$ has a homogeneous…

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…