researcher

Chaya Keller

33 papers hereh-index 6189 citations44 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

first author26
middle author7

Across the 33 of 33 papers where every author was matched, so the position is known.

fields

math.CO31
cs.CG1
cs.DM1

identity via Semantic Scholar / OpenAlex

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 2023Show all

2 papers · 1 filter

math.CO2023

Zarankiewicz's problem via $ε$ -t-nets

Chaya Keller, Shakhar Smorodinsky

The classical Zarankiewicz's problem asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain the complete bipartite graph $K_{t, t}$ . In one…

math.CO2023

An $(ℵ_{0}, k + 2)$ -Theorem for $k$ -Transversals

Chaya Keller, Micha A. Perles

A family $F$ of sets satisfies the $(p, q)$ -property if among every $p$ members of $F$ , some $q$ can be pierced by a single point. The celebrated $(p, q)$ -theorem…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Zarankiewicz's problem via ε-t-nets

An (ℵ0​,k+2)-Theorem for k-Transversals

Zarankiewicz's problem via $ε$ -t-nets

An $(ℵ_{0}, k + 2)$ -Theorem for $k$ -Transversals