We give an elementary proof of Jean de Rumeur's conjecture stating that in any digraph G of diameter D, such that the sum of the indegree and outdegree of every vertex is at most 2d, the number of vertices is at most 1 +d+d'+ ..' +dD. Our result implies that known good solutions in the case d + = d
Proof of a conjecture of José L. Rubio de Francia
✍ Scribed by E. Berkson; T. A. Gillespie; J. L. Torrea
- Book ID
- 105874785
- Publisher
- Springer-Verlag
- Year
- 2005
- Tongue
- French
- Weight
- 156 KB
- Volume
- 251
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let \(M_{n}\) be the Minkowski fundamental domain for the space of \(n \times n\) real, symmetric, and positive definite matrices under the action of the unimodular group \(S L_{n}(Z)\). C. L. Siegel conjectured that \(d(A, B)-f(A, B) \leqslant C(n)\), for \(A, B \in M_{n}\), where \(d\) and \(f\) a
We present a proof for a conjecture of De Caen and Van Dam (2001, Europ. J. Combinatorics, 22, 297-301) concerning the existence of a four-class association scheme on the set of all unordered pairs of points of the projective line PG(1, q 2 ), where q = 2 m .