1 citations · 2 across the 10 of their papers we have counts for
Showing 2023 · math.COShow all
3 papers · 2 filters
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 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 , there exists such that every -vertex graph that contains no induced copy of 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 , there exists such that every -vertex graph that contains no induced copy of has a homogeneous…