Ida Kantor

activity

20112022

most citedOn the growth of the Möbius function of permutations

4 citations · 6 across the 6 of their papers we have counts for

collaborators

8 papers

math.MG2022

Metric spaces in which many triangles are degenerate

Vašek Chvátal, Ida Kantor

Richmond and Richmond (Amer. Math. Monthly 104 (1997), 713--719) proved the following theorem: If, in a metric space with at least five points, all triangles are degenerate, then t…

math.CO2022

Metric hypergraphs and metric-line equivalences

Vašek Chvátal, Ida Kantor

In a metric space $M = (X, d)$ , we say that $v$ is between $u$ and $w$ if $d (u, w) = d (u, v) + d (v, w)$ . Taking all triples ${u, v, w}$ such that $v$ is between $u$ and $w$ , one can associat…

math.CO2020

Lines in the plane with the $L_{1}$ metric

Ida Kantor

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chvátal asked whether an analogous state…

math.CO2018★ 4 cited

On the growth of the Möbius function of permutations

Vít Jelínek, Ida Kantor, Jan Kynčl +1

We study the values of the Möbius function $μ$ of intervals in the containment poset of permutations. We construct a sequence of permutations $π_{n}$ of size $2 n - 2$ for which $μ(1,π_…

math.CO2017

Kneser ranks of random graphs and minimum difference representations

Zoltán Füredi, Ida Kantor

Every graph $G = (V, E)$ is an induced subgraph of some Kneser graph of rank $k$ , i.e., there is an assignment of (distinct) $k$ -sets $v \mapsto A_{v}$ to the vertices $v \in V$ such tha…

math.CO2014

A coding problem for pairs of subsets

Bela Bollobas, Zoltan Furedi, Ida Kantor +2

Let $X$ be an $n$ --element finite set, $0 < k \leq n /2$ an integer. Suppose that ${A_{1}, A_{2}}$ and ${B_{1}, B_{2}}$ are pairs of disjoint $k$ -element subsets of $X$ (that is, $|A_1|=|A…

math.CO2012★ 2 cited

Towards a de Bruijn-Erd\H os theorem in the $L_{1}$ -metric

Ida Kantor, Balazs Patkos

A well-known theorem of de Bruijn and Erdős states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chvátal asked whether an analogous…

math.CO2011

List colorings with distinct list sizes, the case of complete bipartite graphs