Amrit Kandasamy

collaborators

3 papers

math.CO2026

Tuza's Conjecture for Graphs of Maximum Degree at Most 10

Amrit Kandasamy

For a finite simple graph $G$ , let $ν (G)$ be the maximum number of pairwise edge disjoint triangles and $τ (G)$ the minimum number of edges meeting every triangle. Tuza conjectured…

math.CO2026

Improved Explicit and Algorithmic Lower Bounds for r(5,t)

Amrit Kandasamy, Lawrence Zhou, Levi Segal

We modify a construction of Bradač \cite{Bradac26} using a vertex ordering to give, for every prime power $q$ , an explicit $K_{5}$ free graph with more than $q^{7}$ vertices and indepe…

math.AC2026

The Bi-UFS Positive Conjecture for algebraic semidomains

Aaditya Bilakanti, Marly Gotti, Amrit Kandasamy +5

A semidomain is called bi-UFS if both its additive monoid and its nonzero multiplicative monoid are unique factorization monoids. The Bi-UFS Positive Conjecture predicts that the o…