Common factors of integers: A graphic view
type: Item
instance of: scholarly article
title: Common factors of integers: A graphic view
zbMATH Open document ID: 0642.05052
DOI: 10.1016/0012-365X(87)90136-1
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: From author's abstract: ``The common factor graph of a set of integers has the integers as vertices, two vertices being adjacent just if they have a proper common factor. A characterization of common factor graphs is given. The common factor graph of P, the set of integers \(\geq 2\), is a diameter 2 graph in which every included subgraph is a common factor graph, and every common factor graph is isomorphic to an induced subgraph of the common factor graph of P. We discuss the problem of finding the length of the smallest initial segment of P which contains a given finite graph as an induced subgraph. Connected common factor graphs of runs of consecutive integers are considered in detail.''
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 11A05
zbMATH DE Number: 4045801
zbMATH Keywords: common factor graph
author: Roger B. Eggleton
reviewed by: Štefan Znám
MaRDI profile type: Publication
cites work: Q5522904
cites work: The product of consecutive integers is never a power
cites work: On Blocks of N Consecutive Integers
cites work: Eine Eigenschaft aufeinanderfolgender Zahlen
cites work: Q5811299
cites work: Q5776927
cites work: Approximate formulas for some functions of prime numbers
cites work: Q5557841
cites work: Sur deux propriétés des classes d'ensembles
description: scientific article; zbMATH DE number 4045801