Debmalya Bandyopadhyay

collaborators

2 papers

math.CO2026

Towards Pósa's Conjecture for $3$ -graphs

Debmalya Bandyopadhyay, Allan Lo, Richard Mycroft

We prove that every $3$ -graph $H$ on $n$ vertices with minimum codegree $δ_{2} (H) \geq 7 n /9 + o (n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Beden…

math.CO2024

Polynomial bounds for monochromatic tight cycle partition in $r$ -edge-coloured $K_{n}^{(k)}$

Debmalya Bandyopadhyay, Allan Lo

Let $K_{n}^{(k)}$ be the complete $k$ -graph on $n$ vertices. A $k$ -uniform tight cycle is a $k$ -graph with its vertices cyclically ordered so that every $k$ consecutive vertices form…

Towards Pósa's Conjecture for 3-graphs

Polynomial bounds for monochromatic tight cycle partition in r-edge-coloured Kn(k)​

Towards Pósa's Conjecture for $3$ -graphs

Polynomial bounds for monochromatic tight cycle partition in $r$ -edge-coloured $K_{n}^{(k)}$