\(f\)-optimal factors of infinite graphs
type: Item
instance of: scholarly article
title: \(f\)-optimal factors of infinite graphs
zbMATH Open document ID: 0759.05075
DOI: 10.1016/0012-365X(91)90339-4
published in: Discrete Mathematics
publication date: 1992-09-27T00:00:00Z
review text: Given an infinite graph \(G=(V,E)\) and a function \(f\) from \(V\) into the set of natural numbers, a perfect \(f\)-factor is a subgraph \(H=(V,F)\) with \(F\subseteq E\) such that \(\deg_ H(v)=f(v)\) for each vertex \(v\in V\). A necessary and sufficient condition for the existence of perfect \(f\)- factors of countable graphs is proved. Also nonperfect factors which approximate \(f\) optimally are studied.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 63138
zbMATH Keywords: infinite graph
zbMATH Keywords: \(f\)-factor
author: Frank Niedermeyer
MaRDI profile type: Publication
cites work: On an obstruction for perfect matchings
cites work: Injective choice functions
cites work: Q4156432
cites work: Matching theory
cites work: Q3998016
cites work: Q3041246
cites work: Matchings in Countable Graphs
cites work: Q4187841
cites work: The method of alternating paths
Wikidata QID: Q126408303
description: scientific article; zbMATH DE number 63138