In rural China,the trend of population aging and family hollowing is becoming increasingly severe.Traditional elderly care methods are no longer adequate to meet the growing demand for elderly care,leading to the emer...In rural China,the trend of population aging and family hollowing is becoming increasingly severe.Traditional elderly care methods are no longer adequate to meet the growing demand for elderly care,leading to the emergence of mutual-support elderly care as a new approach to elderly care.Mutual support has gained widespread practice and has become a vital component of the rural elderly service system.However,rural mutual-support elderly care encounters development bottlenecks,including local cultural resilience,disembedding of social relationships,gaps in policies and regulations,and multiple coordination challenges.Embeddedness theory emphasizes the need for social behavior to be embedded in the network of social connections,providing a valuable theoretical framework for mutual-support elderly care.Drawing on embeddedness theory,this paper investigates the accessibility of mutual-support elderly care in rural areas by examining cognitive embeddedness,relational embeddedness,systemic embeddedness,and structural embeddedness.By addressing the development bottlenecks of mutual-support elderly care in rural China,this paper aims to propose ideas for achieving high-quality development in rural mutual-support elderly care.展开更多
A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph i...A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph is the maximum of integer k with the property that the graph has a relative embedding in the orientable surface with k handles. A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph of the relative tree of the graph is planar. Under this condition, just like maximum genus embedding, a graph does not have any locally strict maximum genus.展开更多
基金supported by the General Project of National Social Sciences Fund of China (No.20BZZ042)Heilongjiang Province Philosophy and Social Science Research Program (No.23RKD136)。
文摘In rural China,the trend of population aging and family hollowing is becoming increasingly severe.Traditional elderly care methods are no longer adequate to meet the growing demand for elderly care,leading to the emergence of mutual-support elderly care as a new approach to elderly care.Mutual support has gained widespread practice and has become a vital component of the rural elderly service system.However,rural mutual-support elderly care encounters development bottlenecks,including local cultural resilience,disembedding of social relationships,gaps in policies and regulations,and multiple coordination challenges.Embeddedness theory emphasizes the need for social behavior to be embedded in the network of social connections,providing a valuable theoretical framework for mutual-support elderly care.Drawing on embeddedness theory,this paper investigates the accessibility of mutual-support elderly care in rural areas by examining cognitive embeddedness,relational embeddedness,systemic embeddedness,and structural embeddedness.By addressing the development bottlenecks of mutual-support elderly care in rural China,this paper aims to propose ideas for achieving high-quality development in rural mutual-support elderly care.
文摘A relative embedding of a connected graph is an embedding of the graph in some surface with respect to some closed walks, each of which bounds a face of the embedding. The relative maximum genus of a connected graph is the maximum of integer k with the property that the graph has a relative embedding in the orientable surface with k handles. A polynomial algorithm is provided for constructing relative maximum genus embedding of a graph of the relative tree of the graph is planar. Under this condition, just like maximum genus embedding, a graph does not have any locally strict maximum genus.
