Abhishek Methuku

most citedAvoiding long Berge cycles, the missing cases

k = r + 1

and

k = r + 2

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022★ 2 cited

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

We prove that for $n \in N$ and an absolute constant $C$ , if $p \geq C lo g^{2} n / n$ and $L_{i, j} \subseteq [n]$ is a random subset of $[n]$ where each $k \in [n]$ is include…

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 $…

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor

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

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