On the two conjectures of Graffiti
โ Scribed by Xiao-Dong Zhang
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 201 KB
- Volume
- 385
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approxima
## Chetwynd and Hilton have elsewhere posed two conjectures, one a general statement on edge-colouring simple graphs G with A(G) > i lV(G)I, and a second to the effect that a regular simple graph G with d(G) 3 -1 IV(G) 1 is l-factorizable. We set out the evidence for both these conjectures and sho
In this note we answer two conjectures of Geller as given in this journal. The technical language used herein is as that in Geller's article, and hence no dictionary of these words will be given. For the sake of clarity of presentation, each of Geller's conjectures is answered in a separate section.
A positive integer m is said to be a practical number if every integer n, with 1 n \_(m), is a sum of distinct positive divisors of m. In this note we prove two conjectures of Margenstern: (i) every even positive integer is a sum of two practical numbers; (ii) there exist infinitely many practical
We discuss two conjectures. (1) If a system S โ En is consistent over R (C), then S has a real (complex) solution which consists of numbers whose absolute values belong to [0, 2 2 n-2 ]. (2) If a system S โ Wn is consistent over G, then S has a solution (x1, . . . , xn) โ (G โฉ Q) n in which |xj| โค