M. Matching Theory for Bipartite Graphs

2020 ◽  
pp. 131-142
Keyword(s):  
Bipartite Graphs ◽  
Matching Theory

Bipartite Graphs and their Applications

1998 ◽  
Author(s):  
Armen S. Asratian ◽  
Tristan M. J. Denley ◽  
Roland Häggkvist
Keyword(s):  
Bipartite Graphs

Reforming the Labour Market in Good and Bad Times

2018 ◽  
Author(s):  
Britta Gehrke ◽  
Enzo Weber
Keyword(s):  
Time Series ◽  
Business Cycle ◽  
Labour Market ◽  
Markov Switching ◽  
Matching Theory ◽  
Market Reforms ◽  
Structural Reforms ◽  
Labour Market Reforms ◽  
Short Run ◽  
The Business Cycle

This chapter discusses how the effects of structural labour market reforms depend on whether the economy is in expansion or recession. Based on an empirical time series model with Markov switching that draws on search and matching theory, we propose a novel identification of reform outcomes and distinguish the effects of structural reforms that increase the flexibility of the labour market in distinct phases of the business cycle. We find in applications to Germany and Spain that reforms which are implemented in recessions have weaker expansionary effects in the short run. For policymakers, these results emphasize the costs of introducing labour market reforms in recessions.

Hurricane in Bipartite Graphs: The Lethal Nodes of Butterflies

2020 ◽  
Author(s):  
Qiuyu Zhu ◽  
Jiahong Zheng ◽  
Hao Yang ◽  
Chen Chen ◽  
Xiaoyang Wang ◽  
...  
Keyword(s):  
Bipartite Graphs

Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150

2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang
Keyword(s):  
Automorphism Group ◽  
Bipartite Graphs ◽  
Type Ii ◽  
Symmetric Graph ◽  
Trivalent Graph ◽  
Block Graphs ◽  
Group A ◽  
Vertex Transitive ◽  
Vertex Transitive Graphs ◽  
Transitive Graphs

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

Sign in / Sign up

Export Citation Format

Share Document