This paper investigates Hungary's inflationary exposures to global price movements using a simple cost-push input-output price model and a database of inflation-to-output price elasticities (Global Inflation-to-Output Price Elasticity Database, GIOPED) developed on the basis of the OECD's Inter-Country Input-Output Tables. Inflation elasticities are decomposed into local, simple, and complex global value chain effects by applying Wang's decomposition scheme (Wang et al. 2017) to price movements and inflation. Our empirical analysis based on GIOPED elasticities shows that Hungary is highly exposed to global value chain price transmissions originating in Germany, Austria, and Russia; and in particular to changes in energy prices. The crude oil and natural gas price boom and the resulting energy crises caused a significant increase in consumer price levels in Hungary; however, this explains only a fraction of current inflation rates.

In this research paper, we study 3-uniform hypergraphs (Formula presented.) with circular symmetry. Two parameters are considered: the largest size (Formula presented.) of a set (Formula presented.) not containing any edge (Formula presented.), and the maximum number (Formula presented.) of colors in a vertex coloring of (Formula presented.) such that each (Formula presented.) contains two vertices of the same color. The problem considered here is to characterize those (Formula presented.) in which the equality (Formula presented.) holds for every induced subhypergraph (Formula presented.) of (Formula presented.). A well-known objection against (Formula presented.) is where (Formula presented.), termed “monostar”. Steps toward a solution to this approach is to investigate the properties of monostar-free structures. All such (Formula presented.) are completely identified up to 16 vertices, with the aid of a computer. Most of them can be shown to satisfy (Formula presented.), and the few exceptions contain one or both of two specific induced subhypergraphs (Formula presented.), (Formula presented.) on five and six vertices, respectively, both with (Formula presented.) and (Formula presented.). Furthermore, a general conjecture is raised for hypergraphs of prime orders.

Let us suppose that X is a given, finite, not empty set and F is a given collection of subsets of X such that their union equals X, in other words F covers X. Set cover is the problem of selecting as few as possible subsets from F such that their union covers X. Max k-cover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both problems are NP-hard. There is a polynomial time greedy heuristic that iteratively selects the subset from F that covers the largest number of yet uncovered elements. We implemented this greedy algorithm to support the planning of a checking system that is aimed to check the vehicles in a road network. We would like to answer such questions: - How many and which links are sufficient to check a given percentage of all traffic flow? - What percentage of traffic can be checked with given links? This paper defines the necessary data and basic knowledge, gives algorithms to answer the previous questions and also shows the results of an implementation in a road network that contains about 11,000 junctions, 3,000 origin-destination junctions and 26,000 links. © 2008 Springer-Verlag.