Graphs and Combinatorics

, Volume 21, Issue 4, pp 421–425

Structural Remarks on Bipartite Graphs with Unique f-Factors



In this note we will derive some structural results for a bipartite graph G with a unique f-factor. Two necessary conditions will be that G is saturated, meaning that the addition of any edge leads to a second f-factor, and that fA, fB≥1. Here fA and fB are defined as the minimum of f over the vertices in the two partite sets A and B of G, respectively. Our main result states that G has at least fA + fB vertices for which dG (v) = f(v) holds.


Unique f-factor Bipartite graphs Extremal graphs 

Mathematics Subject Classificiation

Primary 05C70 Secondary 05C35 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Watson Wyatt Deutschland GmbHMunichGermany
  2. 2.Lehrstuhl II für MathematikRWTH-AachenAachenGermany

Personalised recommendations