1 citations · 3 across the 10 of their papers we have counts for
10 papers
When are Two Subgroups Independent?
Alexa Gopaulsingh
Rosenmann and Ventura asked "What is the right definition of dependence of subgroups for general groups?". Here we aim to answer this question. We consider a definition of subgroup…
Automorphism groups and Distinguishing Colorings of Central and Middle Graphs
Amitayu Banerjee, Alexa Gopaulsingh, Zalán Molnár
Let G be a simple, finite, connected, and undirected graph. The middle graph M(G) of G is obtained from the subdivision graph S(G) after joining pairs of subdivided vertices that l…
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…
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…
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…
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…
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…
Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice
Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh
We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderab…
Subalgebra Independence
Zalán Gyenis, Alexa Gopaulsingh, Övge Öztürk
Subobject independence as morphism co-possibility has recently been defined in [2] and studied in the context of algebraic quantum field theory. This notion of independence is hand…
On Erdos--Dushnik--Miller theorem without AC
Amitayu Banerjee, Alexa Gopaulsingh
In set theory without the Axiom of Choice, we study the possible placement of Erdos-Dushnik-Miller theorem restricted to an uncountable set of vertices in the hierarchy of weak cho…