3 papers
math.CO2025
The List-distinguishing chromatic number of graphs containing only small complete bigraphs
Amitayu Banerjee
In 2006, Collins and Trenk obtained a general sharp upper bound for the distinguishing chromatic number of a connected graph. Inspired by Catlin's combinatorial techniques from 197…
math.CO2025
On Distinguishing Graphs and Cost Number using Automorphism Representations
Alexa Gopaulsingh, Zalán Molnár, Amitayu Banerjee
A distinguishing coloring of a graph is a vertex coloring such that only the identity automorphism of the graph preserves the coloring. A 2-distinguishable graph is a graph which c…
math.LO2024
On the Rainbow Ramsey theorem and the Canonical Ramsey Theorem for pairs without AC
Amitayu Banerjee, Alexa Gopaulsingh, Zalán Molnár
In set theory without the Axiom of Choice, we study the set-theoretic strength of a generalized version of the Rainbow Ramsey theorem and the Canonical Ramsey Theorem for pairs int…