Abhishek Methuku

An Improvement of the General Bound on the Largest Family of Subsets Avoiding a Subposet

Let La(n, P) be the maximum size of a family of subsets of [n] = {1, 2, … , n} not containing P as a (weak) subposet, and let h(P) be the length of a longest chain in P. The best known upper bound for La(n, P) in terms of |P| and h(P) is due to Chen and Li, who showed that La(n,P)≤1m+1|P|+12(m2+3m−2)(h(P)−1)−1n⌊n/2⌋

An upper bound on the size of diamond-free families of sets

\text {La}(n,P) \le \frac {1}{m+1} \left (|{P}| + \frac {1}{2}(m^{2} +3m-2)(h(P)-1) -1 \right ) {\left (\begin {array}{c}{n}\\ {\lfloor n/2 \rfloor } \end {array}\right )}

On the maximum size of connected hypergraphs without a path of given length

for any fixed m ≥ 1. In this paper we show that La(n,P)≤12k−1|P|+(3k−5)2k−2(h(P)−1)−1n⌊n/2⌋

Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs

\text {La}(n,P) \le \frac {1}{2^{k-1}} \left (|P| + (3k-5)2^{k-2}(h(P)-1) - 1 \right ) {\left (\begin {array}{c}{n}\\ {\lfloor n/2 \rfloor } \end {array}\right )}

A note on the maximum number of triangles in a C 5 -free graph

for any fixed k ≥ 2, improving the best known upper bound. By choosing k appropriately, we obtain that La(n,P)=𝓞h(P)log2|P|h(P)+2n⌊n/2⌋

A note on the maximum number of triangles in a C 5-free graph: ERGEMLIDZE et al.

\text {La}(n,P) = \mathcal {O}\left (h(P) \log _{2}\left (\frac {|{P}|}{h(P)}+2\right ) \right ) {\left (\begin {array}{c}{n}\\ {\lfloor n/2 \rfloor } \end {array}\right )}

On the Turán number of some ordered even cycles

as a corollary, which we show is best possible for general P. We also give a different proof of this corollary by using bounds for generalized diamonds. We also show that the Lubell function of a family of subsets of [n] not containing P as an induced subposet is 𝓞(nc)

Intersecting P-free families

\mathcal {O}(n^{c})

On subgraphs of C 2k -free graphs

for every c>12

Asymptotics for the Tur\'an number of Berge-

c>\frac {1}{2}