62 search results - page 3 / 13 » Toida's Conjecture is True |
114
click to vote
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
JSC
2008
14 years 11 months ago
2008
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
STOC
1996
ACM
15 years 3 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
JGT
2010
14 years 6 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
COMBINATORICS
2006
14 years 11 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...