most citedUpper bounds for the list-distinguishing chromatic number

1 citations · 1 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2025

On the Cost Number of Graphs with Determining Number Two

Alexa Gopaulsingh, Zalán Molnár, Amitayu Banerjee

A distinguishing vertex coloring of a graph is a vertex coloring such that only the identity automorphism of preserves the coloring. A graph is -distinguishable if it ad…

math.LO2025

Notes on ultrafilter extensions of almost bounded structures

Zalán Molnár

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one bin…

math.CO2024

Distinguishing chromatic number of middle and subdivision graphs

Amitayu Banerjee, Alexa Gopaulsingh, Zalán Molnár

Let be a simple finite connected graph of order greater than or equal to . We obtain the following results: (1). We apply a result of Hamada and Yoshimura from 1976 and…

math.CO2024

Brooks' type theorems for coloring parameters of locally finite graphs and Konig's Lemma

Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh

In the past, analogues to Brooks' theorem have been found for various parameters of graph coloring for infinite locally finite connected graphs in ZFC. We prove these theorems are…

math.LO2024

Ultrafilter extensions of bounded graphs are elementary

Zalán Molnár

The main motivation of this paper is the study of first-order model theoretic properties of structures having their roots in modal logic. We will focus on the connections between u…

math.CO2024★ 1 cited

Upper bounds for the list-distinguishing chromatic number

Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh

We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of different classes of simple finite connected graphs. Moreover, we determine two upper bounds for…

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…

math.LO2024

Varieties of modal algebras without the congruence extension property

Zalán Gyenis, Zalán Molnár

In a recent paper, Krawczyk proved that there are continuum many axiomatic extensions of global consequence associated with the modal system that do not admit the local deducti…