𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of k-Sums Modulo k

✍ Scribed by Béla Bollobás; Imre Leader

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
110 KB
Volume
78
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles of even lengths modulo k
Cycles of even lengths modulo k
✍ Ajit A. Diwan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract Thomassen [J Graph Theory 7 (1983), 261–271] conjectured that for all positive integers __k__ and __m__, every graph of minimum degree at least __k__+1 contains a cycle of length congruent to 2__m__ modulo __k__. We prove that this is true for __k__⩾2 if the minimum degree is at least 2

The ramsey number of k5 - e
The ramsey number of k5 - e
✍ C. Clapham; G. Exoo; H. Harborth; I. Mengersen; J. Sheehan 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB
Maximum number of colorings of (2k, k2)-
Maximum number of colorings of (2k, k2)-graphs
✍ Felix Lazebnik; Oleg Pikhurko; Andrew Woldar 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract Let ${\cal F}\_{{2}{k},{k}^{2}}$ consist of all simple graphs on 2__k__ vertices and ${k}^{2}$ edges. For a simple graph __G__ and a positive integer $\lambda$, let ${P}\_{G}(\lambda)$ denote the number of proper vertex colorings of __G__ in at most $\lambda$ colors, and let $f(2k, k^{2

The Sum-of-Digits-Function and Uniform D
The Sum-of-Digits-Function and Uniform Distribution Modulo 1
✍ Michael Drmota; Gerhard Larcher 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The aim of this paper is to provide detailed estimates for the discrepancy of the sequences ([: } s q (n)]) ([x] denotes the fractional part of x) and results concerning the uniform distribution and the discrepancy of the sequences ([: 1 } s q 1 (n)], ..., [: d } s q d (n)]), where :, : 1 , ..., : d

The crossing number of K11 is 100
The crossing number of K11 is 100
✍ Shengjun Pan; R. Bruce Richter 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract The crossing number of __K~n~__ is known for __n__ ⩽ 10. We develop several simple counting properties that we shall exploit in showing by computer that __cr__(__K__~11~ = 100, which implies that __cr__(__K__~12~) = 150. We also determine the numbers of non‐isomorphic optimal drawings o