AbstractLet I(G) denote the independence complex of a graph G=(V,E). Some relations between domination numbers of G and the homology of I(G) are given. As a consequence the following Hall-type conjecture of Aharoni is proved: Let γs∗(G) denote the fractional star-domination number of G and let V=⋃i=1mVi be a partition of V into m classes.If γs∗(G[⋃i∈IVi])>|I|−1 for all I⊂{1,…,m} then G contains an independent set which intersects all m classes
AbstractFor any integer n⩾3, by g(Zn⊕Zn) we denote the smallest positive integer t such that every s...
AbstractA composition of birational maps given by Laurent polynomials need not be given by Laurent p...
The study of properties of space of entire functions of several complex variables was initiated by ...
AbstractIn this paper, we provide an upper bound for the k-tuple domination number that generalises ...
AbstractIn this paper we determine the singular loci of the irreducible components of the variety of...
Let G=(V,E) be a graph. The complement of G is the graph G¯:=(V,[V]2 \ E) where [V]2 is the set of p...
AbstractFor a finite connected graph G let ρ(G̃) be the spectral radius of its universal cover. We p...
AbstractLet M be a compact Riemann surface of genus g, and let P1,…,P4 be distinct points on M. We s...
AbstractWe clarify a difficulty that appears in [R. Quarez, J. Algebra 238 (2001) 139] to bound the ...
AbstractLet Bq(r)=Kr+qK1 be the graph consisting of q distinct (r+1)-cliques sharing a common r-cliq...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
AbstractAssume we have a set of k colors and we assign an arbitrary subset of these colors to each v...
AbstractLet G be a graph and γ(G) denote the domination number of G. A dominating set D of a graph G...
AbstractWe determine the smallest integer n for which the following holds: if G is a nontrivial abel...
AbstractWe give a family of cyclic cubic polynomials whose roots are systems of fundamental units of...
AbstractFor any integer n⩾3, by g(Zn⊕Zn) we denote the smallest positive integer t such that every s...
AbstractA composition of birational maps given by Laurent polynomials need not be given by Laurent p...
The study of properties of space of entire functions of several complex variables was initiated by ...
AbstractIn this paper, we provide an upper bound for the k-tuple domination number that generalises ...
AbstractIn this paper we determine the singular loci of the irreducible components of the variety of...
Let G=(V,E) be a graph. The complement of G is the graph G¯:=(V,[V]2 \ E) where [V]2 is the set of p...
AbstractFor a finite connected graph G let ρ(G̃) be the spectral radius of its universal cover. We p...
AbstractLet M be a compact Riemann surface of genus g, and let P1,…,P4 be distinct points on M. We s...
AbstractWe clarify a difficulty that appears in [R. Quarez, J. Algebra 238 (2001) 139] to bound the ...
AbstractLet Bq(r)=Kr+qK1 be the graph consisting of q distinct (r+1)-cliques sharing a common r-cliq...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
AbstractAssume we have a set of k colors and we assign an arbitrary subset of these colors to each v...
AbstractLet G be a graph and γ(G) denote the domination number of G. A dominating set D of a graph G...
AbstractWe determine the smallest integer n for which the following holds: if G is a nontrivial abel...
AbstractWe give a family of cyclic cubic polynomials whose roots are systems of fundamental units of...
AbstractFor any integer n⩾3, by g(Zn⊕Zn) we denote the smallest positive integer t such that every s...
AbstractA composition of birational maps given by Laurent polynomials need not be given by Laurent p...
The study of properties of space of entire functions of several complex variables was initiated by ...