33 citations · 164 across the 61 of their papers we have counts for
6 papers · 1 filter
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…
A class of graphs of zero Turán density in a hypercube
Maria Axenovich
A graph is cubical if it is a subgraph of a hypercube. For a cubical graph and a hypercube , is the largest number of edges in an -free subgraph of .…
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…
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…
On graphs embeddable in a layer of a hypercube and their extremal numbers
Maria Axenovich, Ryan R. Martin, Christian Winter
A graph is cubical if it is a subgraph of a hypercube. For a cubical graph and a hypercube , is the largest number of edges in an -free subgraph of .…
A note on interval colourings of graphs
Maria Axenovich, António Girão, Lawrence Hollom +5
A graph is said to be interval colourable if it admits a proper edge-colouring using palette in which the set of colours incident to each vertex is an interval. The in…