62 search results - page 1 / 13 » Toida's Conjecture is True |
COMBINATORICS
2002
13 years 4 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
JCT
2006
13 years 4 months ago
2006
We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We the...
CIAC
2010
Springer
14 years 1 months ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
ENDM
2010
13 years 4 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...