An extremal result for divisor functions
โ Scribed by R.A MacLeod
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 59 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We prove that whenever the edge number of a graph of order \(n \geqslant 517\) ensures that it contains every complete graph and every forest with at most \(n\) vertices and at most \(m\) edges, then the graph contains every graph with at most \(n\) vertices and \(m\) edges if \(m<n\). The required
Davenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate repetition and with no alternating subsequence (i.e. of the type ababab...} of the length s. This concept based on a geometrical motivation is due to Davenport and Schinzel in the middle of 1960s. In the late 1