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.
- Approximate formulas for some functions of prime numbers
- Eine Eigenschaft aufeinanderfolgender Zahlen
- scientific article; zbMATH DE number 3235211 (Why is no real title available?)
- scientific article; zbMATH DE number 3273098 (Why is no real title available?)
- scientific article; zbMATH DE number 3037243 (Why is no real title available?)
- scientific article; zbMATH DE number 3072168 (Why is no real title available?)
- On Blocks of N Consecutive Integers
- Sur deux propriétés des classes d'ensembles
- The product of consecutive integers is never a power
This page was built for publication: Common factors of integers: A graphic view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101136)
