Chaya Keller

activity

20092026

most citedOn Convex Geometric Graphs with no

k + 1

Pairwise Disjoint Edges

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

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

A solution to Ringel's circle problem

James Davies, Chaya Keller, Linda Kleist +2

We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. This provides a strong negative answer to Ringel's…

math.CO2021

On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs

Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky +1

For $n \geq s > r \geq 1$ and $k \geq 2$ , write $n \to (s)_{k}^{r}$ if every hyperedge colouring with $k$ colours of the complete $r$ -uniform hypergraph on $n$ vertices has a mon…

math.CO2021

On the number of hyperedges in the hypergraph of lines and pseudo-discs

Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi

Consider the hypergraph whose vertex set is a family of $n$ lines in general position in the plane, and whose hyperedges are induced by intersections with a family of pseudo-discs.…