Representation of finite graphs as difference graphs of S-units. I
From MaRDI portal
(Redirected from Publication:406579)
Representation of finite graphs as difference graphs of \(S\)-units. I
Representation of finite graphs as difference graphs of \(S\)-units. I
Abstract: Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only their values differ by a number which is composed of primes from S. We prove e.g. that for every G there exist infinitely many finite sets S such that G is an S-graph. We deal with cycles and complete bipartite graphs G. We consider the triangles in G for a deeper analysis. Finally we prove that G is an S-graph for all S if and only if G is cubical. Besides combinatorial and numbertheoretical arguments some deep Diophantine results concerning S-unit equations are used in our proofs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3833876 (Why is no real title available?)
- scientific article; zbMATH DE number 426343 (Why is no real title available?)
- scientific article; zbMATH DE number 3425732 (Why is no real title available?)
- scientific article; zbMATH DE number 4200313 (Why is no real title available?)
- scientific article; zbMATH DE number 4152503 (Why is no real title available?)
- scientific article; zbMATH DE number 3825919 (Why is no real title available?)
- scientific article; zbMATH DE number 4075172 (Why is no real title available?)
- scientific article; zbMATH DE number 3730181 (Why is no real title available?)
- scientific article; zbMATH DE number 3749105 (Why is no real title available?)
- scientific article; zbMATH DE number 3550814 (Why is no real title available?)
- scientific article; zbMATH DE number 798645 (Why is no real title available?)
- B-valuations of graphs
- A generalization of the unit and unitary Cayley graphs of a commutative ring
- A survey of the theory of hypercube graphs
- Corrigendum to ``The complexity of cubical graphs
- Irreducibility criteria of Schur-type and Pólya-type
- Linear equations in variables which lie in a multiplicative group
- Longest induced cycles in circulant graphs
- On S-unit equations in two unknowns
- On certain arithmetic graphs and their applications to diophantine problems
- On cubical graphs
- On cycles in the sequence of unitary Cayley graphs
- On discriminants and indices of integers of an algebraic number field.
- On equations in S-units and the Thue-Mahler equation
- On the irreducibility of a class of polynomials, IV
- On the number of solutions of linear equations in units of an algebraic number field
- On the unitary Cayley graph of a finite ring
- Representations of graphs and orthogonal latin square graphs
- Ring elements as sums of units.
- Small points on subvarieties of a torus
- Some properties of unitary Cayley graphs
- Some results and questions related to the generating graph a finite group.
- The difference graph of S-units
Cited in
(5)- scientific article; zbMATH DE number 426343 (Why is no real title available?)
- On the smallest number of terms of vanishing sums of units in number fields
- The difference graph of S-units
- Representation of finite graphs as difference graphs of S-units. II
- On conjectures and problems of Ruzsa concerning difference graphs of S-units
This page was built for publication: Representation of finite graphs as difference graphs of \(S\)-units. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406579)
