A New Result on Alspach's Problem

Abstract.

Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x)≥2 and f(x)≥5 for all x∈V(G). It is proved that if G is an (mg+m−1, mf−m+1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H.

Similar content being viewed by others

Generalized Turán Problems for Complete Bipartite Graphs

Article Open access 23 September 2022

On the Complexity Landscape of Connected f-Factor Problems

Article 30 January 2019

On an extremal inverse problem in graph theory

Article 01 April 2015

Author information

Authors and Affiliations

1. Institute of Applied Mathematics, Academia Sinica, Beijing, 100080, P.R.C., , , , , , XX

   Guiying Yan

Authors

1. Guiying Yan
   View author publications

   You can also search for this author in PubMed Google Scholar

Additional information

Received: January 19, 1996 Revised: November 11, 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, G. A New Result on Alspach's Problem. Graphs Comb 15, 365–371 (1999). https://doi.org/10.1007/s003730050070

Download citation

• Issue Date: September 1999

• DOI: https://doi.org/10.1007/s003730050070

Keywords

• Simple Graph