1. The impact of hormonal contraceptives on skeletal muscle hypertrophyNevena Markov, Matevž Arčon, 2025, izvirni znanstveni članek Opis: Female reproductive hormones such as progesterone and estrogen play an important role in the body as they orchestrate functions of numerous cells including skeletal muscle cells. Onset of menses marks the beginning of reproductive life, whereas menopause marks its cessation. We distinguish three phases of the 28-day menstrual cycle namely follicular, ovulatory and luteal phases. The follicular phase is characterised by marked increases in estrogen, which triggers ovulation. During this phase, estrogen peaks, whereas progesterone levels are low. Following ovulation, the luteal phase commences marked by high progesterone levels and reduced estrogen. Indeed, these periodic fluctuations in reproductive hormones may affect rates of muscle protein synthesis and hence hinder sought adaptations such as skeletal muscle hypertrophy in female athletes. With the introduction of hormonal contraceptives, female athletes were able to have ameliorate the negative effects of the menstrual cycle by reducing menstrual cramping and bleeding. Hormonal contraceptives are constituted of a single or multiple synthetic hormones namely estrogen and progestin. Nevertheless, the impact of hormonal contraceptives on skeletal muscle hypertrophy remains elusive. In this review, we aim to present the potential implications of hormonal contraceptives on skeletal muscle hypertrophy.
Ključne besede: hormonal contraceptives, estrogen, progesterone, muscle hypertrophy, menstrual cycle, resistance training
Objavljeno v RUP: 07.01.2026; Ogledov: 129; Prenosov: 13
 Celotno besedilo (404,75 KB)
Gradivo ima več datotek! Več... |
2. Linear bounds on treewidth in terms of excluded planar minorsJ. Pascal Gollin, Kevin Hendrey, Sang-il Oum, Bruce Reed, 2025, izvirni znanstveni članek Opis: One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for $f(H)$ can be obtained by considering the maximum integer $k$ such that $H$ contains $k$ vertex-disjoint cycles. There exists a graph of treewidth $\Omega(k\log k)$ which does not contain $k$ vertex-disjoint cycles, from which it follows that $f(H) = \Omega(k\log k)$. In particular, if $f(H)$ is linear in $\lvert V(H) \rvert$ for graphs $H$ from a subclass of planar graphs, it is necessary that $n$-vertex graphs from the class contain at most $\lvert V(H) \rvert$ vertex-disjoint cycles. We ask whether this is also a sufficient condition, and demonstrate that this is true for classes of planar graphs with bounded component size. For an $n$-vertex graph $H$ which is a disjoint union of $r$ cycles, we show that ${f(H) \leq 3n/2 + O(r^2 \log r)}$, and improve this to $f(H)$≤$n$+O(√$n$) when $r$=2. In particular this bound is linear when $r$=O(√$n$/logn). We present a linear bound for $f(H)$ when $H$ is a subdivision of an $r$-edge planar graph for any constant~$r$. We also improve the best known bounds for $f(H)$ when $H$ is the wheel graph or the 4×4 grid, obtaining a bound of 160 for the latter.
Ključne besede: graph minor, treewidth, cycle packing
Objavljeno v RUP: 05.01.2026; Ogledov: 216; Prenosov: 2
Celotno besedilo (613,98 KB)
Gradivo ima več datotek! Več... |
3. Plane triangulations without large 2-treesAllan Bickle, Gunnar Brinkmann, 2026, izvirni znanstveni članek Opis: In 1995 Leizhen Cai asked whether each plane triangulation has a spanning 2-tree. This question was recently answered in the negative by Bickle. He gave a plane triangulation on 38 vertices for which each 2-tree contained in it misses at least one vertex. We give a smaller example on 29 vertices and show that for each c>0 there are plane triangulations P=(V,E), so that each 2-tree that is a subgraph of P contains fewer than c|V| vertices. We also give a lower bound for the size of a maximum 2-tree in plane triangulations by proving that each plane triangulation P=(V,E) contains a 2-tree on at least log_2 (|V|-1)+4 -log_2 3 vertices. Finally we give structural criteria based on the decomposition trees of Jackson and Yu that guarantee the existence of spanning 2-trees in plane triangulations. The results are proven by using the close relation of 2-trees to hamiltonian cycles and to induced trees in the dual for plane triangulations without separating triangles.
Ključne besede: 2-tree, triangulation, Hamiltonian cycle, Yutsis partition
Objavljeno v RUP: 21.12.2025; Ogledov: 152; Prenosov: 1
Celotno besedilo (339,53 KB) |
4. Integrating Happiness Research into Endpoint Indicators of Social Life Cycle AnalysisStefan Mann, Melf-Hinrich Ehlers, 2025, izvirni znanstveni članek Opis:
Endpoint indicators for social life cycle analysis (S-LCA) are still less consolidated than those for environmental LCA. There is a broad consensus that human well-being should be the overarching goal of social sustainability and therefore also of S-LCA. However, to date the two major databases for S-LCA are restricted to a multiplication of working hours with a quality- or risk-adjusted factor. This paper aims to evaluate the congruence between this technical pragmatism and well-established findings of happiness research. The analysis starts with the argument that evidence and consequentiality are necessary criteria for any variables used. It is then shown that some of the variables such as poverty are not consequential, while the unit of working hours lacks any evidence about a relationship with subjective well-being. The analysis concludes that a simple pointbased endpoint indicator would be more appropriate for S-LCA than the current hour-based indicator.
Ključne besede: social sustainability, life cycle analysis, indicators, endpoint
Objavljeno v RUP: 18.12.2025; Ogledov: 144; Prenosov: 0
Celotno besedilo (202,42 KB)
Gradivo ima več datotek! Več... |
5. The Impact of Demographic Dynamics on Household Saving in Pre-COVID-19 South AfricaAfamefuna Emmanuel Nwogbo, Joel Hinaunye Eita, Sivan Chetty, 2025, izvirni znanstveni članek Opis: This paper examines the effect of demographic dynamics on household saving in pre-COVID-19 South Africa, across all nine provinces of South Africa. The study used panel autoregressive distributed lag (PARDL) and Dumitrescu-Hurlin panel causality methods. The results revealed a longrun relationship between demographic dynamics and household saving in South Africa, showing that the White working age population had a significant effect on South Africa’s household saving in both the long-run and short-run, while the Black and Coloured working age population groups significantly impacted household saving only in the long-run. However, the Asian/Indian working age population had no effect on household saving in either the long run or short run. The Dumitrescu-Hurlin panel causality analysis revealed a bidirectional causality running between Asian/Indian, Black, and Coloured population groups and household saving, while a unidirectional causality was found running from the White population group to household saving.
Ključne besede: demographics, working age population, aged/elderly population, life-cycle hypothesis, household saving, panel ARDL, Dumitrescu-Hurlin panel causality
Objavljeno v RUP: 18.12.2025; Ogledov: 135; Prenosov: 0
Celotno besedilo (234,48 KB)
Gradivo ima več datotek! Več... |
6. A unified Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groupsJ. Pascal Gollin, Kevin Hendrey, O-joung Kwon, Sang-il Oum, Youngho Yoo, 2025, izvirni znanstveni članek Opis: In 1965, Erdős and Pósa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter and Neumann-Lara asked in 1988 to find all pairs (l, z) of integers where such a duality holds for the family of cycles of length l modulo z. We characterise all such pairs, and we further generalise this characterisation to cycles in graphs labelled with a bounded number of abelian groups, whose values avoid a bounded number of elements of each group. This unifies almost all known types of cycles that admit such a duality, and it also provides new results. Moreover, we characterise the obstructions to such a duality in this setting, and thereby obtain an analogous characterisation for cycles in graphs embeddable on a fixed compact orientable surface.
Ključne besede: Erdős-Pósa property, cycle packing, group-labelled graph
Objavljeno v RUP: 17.11.2025; Ogledov: 334; Prenosov: 8
Celotno besedilo (1,17 MB)
Gradivo ima več datotek! Več... |
7. The social construction of environmental reality : an analysis of life cycle assessment in the food industryPedja Ašanin Gole, Karolina Babič, Vida Sruk, 2025, izvirni znanstveni članek Opis: This article offers a critical sociological-philosophical-communicological review of the Life Cycle Assessment (LCA) method in the context of the food industry. While LCA has been established as a standardized tool for quantifying environmental impacts, this study analyses it not merely as a technical method but as an epistemological construct that actively shapes societal understanding of sustainability. Drawing on the theory of social construction of reality, situated knowledge, and critical theory, the article explores how methodological choices within LCA (e.g., system boundary definition and indicator selection) are not neutral but reflect specific social and political priorities. The findings reveal that standardized LCA approaches oſten lead to epistemological reductionism by homogenizing complex ecological processes and neglecting local contexts and environmental justice issues. Furthermore, the article examines the instrumentalization of LCA in sustainability communication and green marketing, where quantitative data are frequently used to legitimize existing business models rather than to drive systemic change. The discussion emphasizes the need to transcend instrumental rationality and shiſt toward transdisciplinary and deliberative approaches. The article advocates for integrating Social Life Cycle Assessment (S-LCA) and broader Life Cycle Sustainability Assessment (LCSA) frameworks to address sustainability challenges in the food industry more holistically, incorporating social justice and cultural sensitivity.
Ključne besede: life cycle assessment (LCA), social construction of reality, situated knowledge, sustainability environmental communication, epistemology of ethics, sociology of responsibility
Objavljeno v RUP: 10.11.2025; Ogledov: 353; Prenosov: 9
Celotno besedilo (220,73 KB)
Gradivo ima več datotek! Več... |
8. |
9. Primitive, edge-short, isometric, and pantochordal cyclesGover E. C. Guzman, Marcos E. González Laffitte, André Fujita, Peter F. Stadler, 2025, izvirni znanstveni članek Opis: A cycle in a graph G is said to be primitive from its vertex x if at least one of its edges does not belong to any shorter cycle that passes through x. This type of cycle and an associated notion of extended neighborhoods play a key role in message-passing algorithms that compute spectral properties of graphs with short loops. Here, we investigate such primitive cycles and graphs without long primitive cycles in a more traditional graph-theoretic framework. We show that a cycle is primitive from all its vertices if and only if it is isometric. We call a cycle fully redundant cycles if it is not primitive from any of its vertices and show that fully redundant cycles, in particular, are not edge short, i.e., they cannot be represented as the edge-disjoint union of a single edge and two shortest paths in G. The families Rk and Lk of graphs with all cycles of length at least k + 1 being fully redundant and not edge-short, respectively, coincide for k = 3 and k = 4. In these graphs, all cycles of length at least k + 1 are pantochordal, i.e., each of their vertices is incident with a chord. None of these results generalizes to k ≥ 5. Moreover, R₃ = L₃ turn out to be the block graphs, and R₄ = L₄ are the graphs with complete multi-partite blocks. The cographs, finally, are shown to form a proper subset of R₅.
Ključne besede: edge-short cycle, chord, block-graph, complete multipartite graph, wheel graphs, cographs, geodesic cycles, Hamiltonian cycles
Objavljeno v RUP: 03.11.2025; Ogledov: 238; Prenosov: 0
Celotno besedilo (478,50 KB) |
10. Basic tetravalent oriented graphs of independent-cycle typeNemanja Poznanović, Cheryl E. Praeger, 2025, izvirni znanstveni članek Opis: The family OG(4) consisting of graph-group pairs (Γ, G), where Γ is a finite, connected, 4-valent graph admitting a G-vertex-, and G-edge-transitive, but not G-arc-transitive action, has recently been examined using a normal quotient methodology. A subfamily of OG(4) has been identified as ‘basic’, due to the fact that all members of OG(4) are normal covers of at least one basic pair. We provide an explicit classification of those basic pairs (Γ, G) which have at least two independent cyclic G-normal quotients (these are G-normal quotients which are not extendable to a common cyclic normal quotient).
Ključne besede: half-arc-transitive, vertex-transitive graph, edge-transitive graph, normal cover, cycle graph
Objavljeno v RUP: 21.10.2025; Ogledov: 329; Prenosov: 1
Celotno besedilo (398,19 KB) |
