Nika Salia

most citedAvoiding long Berge cycles, the missing cases

k = r + 1

and

k = r + 2

10 citations · 10 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2021

Turan problems for $k$ -geodetic digraphs

James Tuite, Grahame Erskine, Nika Salia

A digraph $G$ is \emph{ $k$ -geodetic} if for any pair of (not necessarily distinct) vertices $u, v \in V (G)$ there is at most one walk of length $\leq k$ from $u$ to $v$ in $G$ . In t…

math.CO2018★ 10 cited

Avoiding long Berge cycles, the missing cases $k = r + 1$ and $k = r + 2$

Beka Ergemlidze, Ervin Győri, Abhishek Methuku +3

The maximum size of an $r$ -uniform hypergraph without a Berge cycle of length at least $k$ has been determined for all $k \geq r + 3$ by Füredi, Kostochka and Luo and for $k < r$ (and $…

Turan problems for k-geodetic digraphs

Avoiding long Berge cycles, the missing cases k=r+1 and k=r+2

Turan problems for $k$ -geodetic digraphs

Avoiding long Berge cycles, the missing cases $k = r + 1$ and $k = r + 2$