No label defined (Q4342017)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1028227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1028227 |
Statements
1 July 1997
0 references
Diophantine equations
0 references
Möbius inversion
0 references
character sums
0 references
quadratic residue
0 references
random graph
0 references
enumeration
0 references
Pell equation
0 references
0.7417787313461304
0 references
0.7255382537841797
0 references
This chapter contains examples of links between graph theory and areas of number theory such as primality and factorization, multiplicative functions, congruences and quadratic residues, and Diophantine equations. For example, a generalization of the Möbius inversion formula can be applied to provide an expression for the number of ways of assigning \(t\) colours to the vertices of a graph \(G\) so that only specified edges join vertices of the same colour. Estimates of character sums have been used to show that quadratic residue graphs have properties that are close to those of a random graph. Some graph-theoretic enumeration results have been used to show that the negative Pell equation \(x^2- dy^2=1\) has a solution for a set of integers \(d\) with positive density. For the entire collection see [Zbl 0862.00008].
0 references