Work

Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs

Year: 2026

Type: article

Abstract: ABSTRACT Given a nonnegative integer weight for each vertex in a multigraph , an ‐bounded subgraph of is a multigraph contained in such that for all . Using Tutte's ‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an ‐bounded subgraph of . When for all , the formula reduces to the classical Tutte–Berge Formula for the maximum size of a matching.

Source: Journal of Graph Theory

DOI: 10.1002/jgt.70019

Authors: Zishen Qu, Douglas B. West

Institutions: University of Illinois Urbana-Champaign, Zhejiang Normal University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $4,150

Funders: National Natural Science Foundation of China, Natural Sciences and Engineering Research Council of Canada