Buscar
Mostrando ítems 1-10 de 1894
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
(Elsevier B.V., 2017)
We show that any 2-colouring of the 3-uniform complete hypergraph Kn (3) on n vertices contains two disjoint monochromatic tight cycles of distinct colours covering all but o(n) vertices of Kn (3). The same result holds ...
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
(Wiley-Liss Inc., 2019)
© 2018 Wiley Periodicals Inc. We show that for every η > 0 there exists an integer n 0 such that every 2-coloring of the 3-uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles ...
Dynamic simulator and model predictive control of an integrated solar combined cycle plant
(Pergamon-Elsevier, 2016)
This paper presents the design and evaluation of a dynamic simulator for an ISCC (integrated solar combined cycle) plant. The design of the simulator is based on the phenomenological equations for both a combined cycle ...
In and out of glacial extremes by way of dust climate feedbacks
(National Academy of Sciences, 2018)
Mineral dust aerosols cool Earth directly by scattering incoming solar radiation and indirectly by affecting clouds and biogeochemical cycles. Recent Earth history has featured quasi-100,000-y, glacial-interglacial climate ...
Latin american growth cycles. Empirical evidence 1960-2000
(Universidad de Chile. Facultad de Economía y Negocios, 2002-06)
This paper measures and explains to what extent Latin American countries’
growth cycles experienced co-movement in the last forty years, using different
methodologies. We find that short lasting cycles showed a great ...
Almost partitioning A 3-edge-colored Kn,n into five monochromatic cycles
(Society for Industrial and Applied Mathematics Publications, 2017)
We show that for any coloring of the edges of the complete bipartite graph Kn,n with three colors there are five disjoint monochromatic cycles which together cover all but o(n) of the vertices. In the same situation, 18 ...
Partitioning edge-colored hypergraphs into few monochromatic tight cycles
(Siam, 2020)
Confirming a conjecture of Gyarfas, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of ...
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
(Wiley-Liss Inc., 2019)
© 2018 Wiley Periodicals, Inc. We show that any complete k-partite graph G on n vertices, with k≥3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours, given that ...
A new method of assessing rates of the futile cycle during glycolytic and gluconeogenic metabolism
(1995)
A method for assessing rates of the futile cycle is presented, and it is illustrated in vitro. Glycolytic- and gluconeogenic-type cycles are simulated for the reactions catalyzed by phosphofructokinase (EC 2.7.1.11) and ...
Some remarks on cycles in graphs and digraphs
(ELSEVIER SCIENCE BV, 2001-04-28)
We surveyseveral recent results on cycles of graphs and directed graphs of the following form:
‘Does there exist a set of cycles with a property P that generates all the cycles by operation
O?’.