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 math.COShow all

11 papers · 1 filter

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…

math.CO2021★ 1 cited

Absolutely avoidable order-size pairs for induced subgraphs

Maria Axenovich, Lea Weber

We call a pair $(m, f)$ of integers, $m \geq 1$ , $0 \leq f \leq (2 m)$ , \emph{absolutely avoidable} if there is $n_{0}$ such that for any pair of integers $(n, e)$ with $n > n_{0}$ an…

math.CO2020

Strong complete minors in digraphs

Maria Axenovich, António Girão, Richard Snyder +1

Kostochka and Thomason independently showed that any graph with average degree $Ω (r lo g r)$ contains a $K_{r}$ minor. In particular, any graph with chromatic number $Ω(r\sqrt{…

math.CO2020

The Erdős-Hajnal conjecture for three colors and multiple forbidden patterns

Maria Axenovich, Richard Snyder, Lea Weber

Erdős and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at le…

math.CO2020

Bipartite independence number in graphs with bounded maximum degree

Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder +1

We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size $t$ in a bipartite graph $G$ is a copy of $K_{t, t}$ in the bipartite…

math.CO2019

Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs

Maria Axenovich, Casey Tompkins, Lea Weber

For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K_{t,t}. For a class F of graphs, let h(F)= min {h(G): G\in F}. We sa…