Zobrazeno 1 - 10
of 10
pro vyhledávání: '"GOPAULSINGH, ALEXA"'
Let $G$ be a simple finite connected graph of order $n$ greater than or equal to $3$. We obtain the following results: (1). We apply a result of Hamada and Yoshimura from 1976 and some recent results of Alikhani and Soltani (2020) and Kalinowski and
Externí odkaz:
http://arxiv.org/abs/2411.07000
In the past, analogies 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 not provable in ZF (i.e. the Zermelo-Fraenkel set theory without the A
Externí odkaz:
http://arxiv.org/abs/2408.00812
We prove analogs of Brooks' Theorem for the list-distinguishing chromatic number of finite connected graphs. Moreover, we give new examples to determine two sharp upper bounds for the list-distinguishing chromatic number of a graph G in terms of the
Externí odkaz:
http://arxiv.org/abs/2405.12733
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 introduced by Erd\H{o}s and Rado, concerning their interrelation with sev
Externí odkaz:
http://arxiv.org/abs/2401.02215
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-orderable to prove that the following statements are equivalent to K\H{o}nig
Externí odkaz:
http://arxiv.org/abs/2309.06116
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 handy when it comes to systems coming from physics, but when directly appl
Externí odkaz:
http://arxiv.org/abs/2306.11659
Autor:
Banerjee, Amitayu, Gopaulsingh, Alexa
Publikováno v:
Bulletin of the Polish Academy of Sciences - Mathematics 71 (2023), 1-21
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 choice forms. We also answer a part of a question raised by Lajos Soukup.
Externí odkaz:
http://arxiv.org/abs/2211.05665
Autor:
Gopaulsingh, Alexa
We examine double successive approximations on a set, which we denote by $L_2L_1, \ U_2U_1, U_2L_1,$ $L_2U_1$ where $L_1, U_1$ and $L_2, U_2$ are based on generally non-equivalent equivalence relations $E_1$ and $E_2$ respectively, on a finite non-em
Externí odkaz:
http://arxiv.org/abs/1612.03814
Autor:
Gopaulsingh, Alexa
We examine non-dual relational extensions of rough set approximations and find an extension which satisfies surprisingly many of the usual rough set properties. We then use this definition to give an explanation for an observation made by Samanta and
Externí odkaz:
http://arxiv.org/abs/1612.01857
Publikováno v:
Mathematical Reports; 2023, Vol. 25 Issue 4, p589-601, 13p
