Agnijo Banerjee

collaborators

3 papers

math.CO2026

Uniformly balanced $H$ -factors in multicoloured complete graphs

Agnijo Banerjee, Lawrence Hollom

A balanced colouring of a graph is one in which every colour appears the same number of times. Given a fixed graph $H$ on $r$ vertices and a balanced $k$ -colouring of the complete…

math.CO2023

A proof of a Frankl-Kupavskii conjecture on intersecting families

Agnijo Banerjee

A family $F \subset P (n)$ is $r$ -wise $k$ -intersecting if $∣ A_{1} \cap \dots \cap A_{r} ∣ \geq k$ for any $A_{1}, \dots, A_{r} \in F$ . It is easily seen that i…

cs.CC2023

The complexity of decomposing a graph into a matching and a bounded linear forest

Agnijo Banerjee, João Pedro Marciano, Adva Mond +2

Deciding whether a graph can be edge-decomposed into a matching and a $k$ -bounded linear forest was recently shown by Campbell, H{ö}rsch and Moore to be NP-complete for every $k \g…

Uniformly balanced H-factors in multicoloured complete graphs

A proof of a Frankl-Kupavskii conjecture on intersecting families

The complexity of decomposing a graph into a matching and a bounded linear forest

Uniformly balanced $H$ -factors in multicoloured complete graphs